Reasoning about change: time and causation from the standpoint of artificial intelligence
Reasoning about change: time and causation from the standpoint of artificial intelligence
A semantical approach to nonmonotonic logics
Readings in nonmonotonic reasoning
Reasoning about truth (research note)
Artificial Intelligence
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
What does a conditional knowledge base entail?
Artificial Intelligence
A logic for reasoning with inconsistency
Journal of Automated Reasoning
General patterns in nonmonotonic reasoning
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Resolution for quantified Boolean formulas
Information and Computation
Artificial Intelligence
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Signed Systems for Paraconsistent Reasoning
Journal of Automated Reasoning
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
Journal of Automated Reasoning
Modeling Paraconsistent Reasoning by Classical Logic
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
A Simple Signed System for Paraconsistent Reasoning
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Improvements to the Evaluation of Quantified Boolean Formulae
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Three-Valued Logics for Inconsistency Handling
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Representing paraconsistent reasoning via quantified propositional logic
Inconsistency Tolerance
On the complexity of paraconsistent inference relations
Inconsistency Tolerance
Modelling uncertain positive and negative reasons in decision aiding
Decision Support Systems
Distance-based paraconsistent logics
International Journal of Approximate Reasoning
Reasoning under inconsistency: A forgetting-based approach
Artificial Intelligence
Extending paraconsistent SROIQ
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
| Hi-index | 0.00 |
We introduce a uniform approach of representing a variety ofparaconsistent nonmonotonic formalisms by quantified Booleanformulae (QBFs) in the context of multiple-valued logics. We showthat this framework provides a useful platform for capturing, in asimple and natural way, a wide range of methods for preferentialreasoning. The outcome is a subtle approach to represent theunderlying formalisms, which induces a straightforward way tocompute the corresponding entailments: By incorporatingoff-the-shelf QBF solvers it is possible to simulate within ourframework various kinds of preferential formalisms, among which arePriest's logic LPm of reasoning with minimal inconsistency, Batens'adaptive logic ACLuNs2, Besnard and Schaub's inference relation&vbar;=n, a variety of formula-preferentialsystems, some bilattice-based preferential relations (e.g.,&vbar;=I1 and&vbar;=I2), and consequencerelations for reasoning with graded uncertainty, such as thefour-valued logic &vbar;=4c.