A decidable first-order logic for knowledge representation
Journal of Automated Reasoning
Towards a theory of access-limited logic for knowledge representation
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Taxonomic syntax for first order inference
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Toward efficient default reasoning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Resource-bounded Relational Reasoning: Induction and Deduction Through Stochastic Matching
Machine Learning - Special issue on multistrategy learning
A Logic for Approximate First-Order Reasoning
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Resource-Bounded Paraconsistent Inference
Annals of Mathematics and Artificial Intelligence
Non-deterministic semantics for logics with a consistency operator
International Journal of Approximate Reasoning
Resource-bounded inference from inconsistent belief bases
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Non-deterministic semantics for paraconsistent C-systems
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Semantics and proof-theory of depth bounded Boolean logics
Theoretical Computer Science
| Hi-index | 0.00 |
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a 驴 b 驴 c, then c should be an obvious implication. However, devising a tractable semantics that allows unit resolution has proven to be an elusive goal. We propose a 3-valued semantics for a tractable fragment of propositional logic that is inherently non-deterministic: the denotation of a formula is not uniquely determined by the denotation of the variables it contains. We show that this semantics yields a tractable, sound and complete decision procedure. We generalize this semantics to a family of semantics, tied to Dalal's notion of intricacy, of increasing deductive power and computational complexity.