Foundations of logic programming
Foundations of logic programming
Semantical considerations on nonmonotonic logic
Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
On the relation between default and autoepistemic logic
Artificial Intelligence
An algorithm to compute circumscription
Artificial Intelligence
General theory of cumulative inference
Proceedings of the 2nd international workshop on Non-monotonic reasoning
All I know: a study in autoepistemic logic
Artificial Intelligence
Some computational aspects of circumscription
Journal of the ACM (JACM)
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Theoretical foundations for non-monotonic reasoning in expert systems
Logics and models of concurrent systems
The meaning of negative premises in transition system specifications (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
Transition system specifications with negative premises (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
A first step towards autoepistemic logic programming
Computers and Artificial Intelligence
Cumulative default logic: in defense of nonmonotonic inference rules
Artificial Intelligence
Proceedings of the first international workshop on Logic programming and non-monotonic reasoning
Proceedings of the first international workshop on Logic programming and non-monotonic reasoning
Implementing deductive databases by linear programming
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Implementing stable semantics by linear programming
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Handbook of logic in artificial intelligence and logic programming
Handbook of logic in artificial intelligence and logic programming
Querying disjunctive databases through nonmonotonic logics
Theoretical Computer Science
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Is Non-Monotonic Reasoning Always Harder?
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Non-elementary Speed-Ups in Default Reasoning
ECSQARU/FAPR '97 Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning
Sequent Calculi for Default and Autoepistemic Logics
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Tableau Calculus for Minimal Model Reasoning
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Sequent Calculus for Skeptical Default Logic
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On Proof Complexity of Circumscription
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Sequent Calculus for Circumscription
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
An Extended Framework for Default Reasoning
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Reasoning with Open Logic Programs
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Computing stable models: worst-case performance estimates
Theory and Practice of Logic Programming
Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
Annals of Mathematics and Artificial Intelligence
The Complexity of Reasoning for Fragments of Default Logic
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Proof complexity of propositional default logic
Archive for Mathematical Logic
Proof complexity of non-classical logics
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Proof complexity of propositional default logic
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
The complexity of theorem proving in autoepistemic logic
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
A uniform proof-theoretic reconstruction of the major nonmonotonic logics is introduced. It consists of analytic sequent calculi where the details of nonmonotonic assumption making are modelled by an axiomatic rejection method. Another distinctive feature of the calculi is the use of provability constraints that make reasoning largely independent of any specific derivation strategy. The resulting account of nonmonotonic inference is simple and flexible enough to be a promising playground for investigating and comparing proof strategies, and for describing the behavior of automated reasoning systems. We provide some preliminary evidence for this claim by introducing optimized calculi, and by simulating an existing tableaux-based method for circumscription. The calculi for skeptical reasoning support concise proofs that may depend on a strict subset of the given theory. This is a difficult task, given the nonmonotonic behavior of the logics.