Special relations in automated deduction
Journal of the ACM (JACM) - The MIT Press scientific computation series
Resolution proof systems: an algebraic theory
Resolution proof systems: an algebraic theory
Non-clausal Reasoning with Propositional Definite Theories
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Fast context switching in real-time propositional reasoning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Model-theoretic semantics and tractable algorithm for CNF-BCP
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
An Efficient Proof Method for Non-clausal Reasoning
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Extending Polynomiality to a Class of Non-clausal Many-Valued Horn-Like Formulas
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Finding Tractable Formulas in NNF
CL '00 Proceedings of the First International Conference on Computational Logic
Non-Clausal Reasoning with Definite Theories
Fundamenta Informaticae
Non-Clausal Reasoning with Definite Theories
Fundamenta Informaticae
| Hi-index | 0.00 |
Non-clausal refinement of Boolean Constraint Propagation inference procedure for classical logic, called P-BCP, is introduced within a new knowledge representational formalism of polarized formulas. P-BCP is a sound, incomplete, and linear-time inference procedure. It is shown that P-BCP can be adopted for tractable reasoning in a number of non-classical logics (including some modal and finitely-valued logics).