Abstract
The syntactic framework of the so-called saturated substitutions is defined and used to obtain new characterizations of SAT as well as the classes of minimal and maximal models of formulas of classical propositional logic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, Z., Toda, S.: The complexity of selecting maximal solutions. Information and Computation 119, 231–239 (1995)
Kautz, H., Selman, B.: Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In: Proc. of AAAI 1996 (1996)
Dantsin, E., Hirsch, E.A., Wolper, A.: Algorithms for SAT based on Search in Hamming Balls. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 141–151. Springer, Heidelberg (2004)
Kavvadias, D.J., Stavropoulos, E.C.: An algorithm for generating all maximal models of Boolean expressions. In: Proc. of the 4th Panhellenic Logic Symposium, pp. 125–129 (2003)
Khardon, R., Roth, D.: Reasoning with Models. Artificial Intelligence 87, 187–213 (1996)
Khardon, R., Roth, D.: Default-reasoning with Models. In: Proc. of IJCAI 1995, pp. 319–325 (1995)
Kirousis, L.M., Kolaitis, P.G.: The complexity of minimal satisfiability problems. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 407–418. Springer, Heidelberg (2001)
de Kleer, J., Mackworth, A., Reiter, R.: Characterizing diagnoses and systems. Artificial Intelligence 56, 197–222 (1992)
Paturi, R., Pudlák, P., Zane, F.: Satisfiability Coding Lemma. In: Proc. of FOCS 1997, pp. 566–574 (1997)
Selman, B., Kautz, H.A.: Model-preference default theories. Artificial Intelligence 45, 287–322 (1990)
Selman, B., Kautz, H., Cohen, B.: Noise Strategies for Local Search. In: Proc. of AAAI 1994, pp. 337–343 (1994)
Smith, A., Veneris, A., Viglas, A.: Design Diagnosis Using Boolean Satisfiability. In: IEEE Asian-South Pacific Design Automation Conference (2004)
Stachniak, Z.: Exploiting Polarity in Multiple-Valued Inference Systems. In: Proc. of the 31st IEEE Int. Symp. on Multiple-Valued Logic, pp. 149–156 (2001)
Stachniak, Z.: Going Non-clausal. In: Proc. of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing, SAT 2002, pp. 316–322 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belov, A., Stachniak, Z. (2005). Substitutional Definition of Satisfiability in Classical Propositional Logic. In: Bacchus, F., Walsh, T. (eds) Theory and Applications of Satisfiability Testing. SAT 2005. Lecture Notes in Computer Science, vol 3569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499107_3
Download citation
DOI: https://doi.org/10.1007/11499107_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26276-3
Online ISBN: 978-3-540-31679-4
eBook Packages: Computer ScienceComputer Science (R0)