Substitutional definition of satisfiability in classical propositional logic

Authors:
Anton Belov;Zbigniew Stachniak
Affiliations:
Department of Computer Science and Engineering, York University, Toronto, Canada;Department of Computer Science and Engineering, York University, Toronto, Canada
Venue:
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Year:
2005

Citing 11
Cited 0

Model-preference default theories

Artificial Intelligence
Characterizing diagnoses and systems

Artificial Intelligence
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The complexity of selecting maximal solutions

Information and Computation
Reasoning with models

Artificial Intelligence
The Complexity of Minimal Satisfiability Problems

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Satisfiability Coding Lemma

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Exploiting Polarity in Multiple-Valued Inference Systems

ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic
Design diagnosis using Boolean satisfiability

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Default-reasoning with models

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

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.