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
Formalizing nonmonotonic reasoning systems
Artificial Intelligence
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
Readings in nonmonotonic reasoning
Readings in nonmonotonic reasoning
Readings in nonmonotonic reasoning
A semantical approach to nonmonotonic logics
Readings in nonmonotonic reasoning
Compiling circumscriptive theories into logic programs
Proceedings of the 2nd international workshop on Non-monotonic reasoning
HCLIE: a logic-based requirement language for new software engineering paradigms
Software Engineering Journal
A Hybrid Knowledge Representation as a Basis of Requirement Specification and Specification Analysis
IEEE Transactions on Software Engineering - Special issue on software maintenance
Nonmonotonic Logic II: Nonmonotonic Modal Theories
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Knowledge-Based Software Development for Real-Time Distributed Systems
Knowledge-Based Software Development for Real-Time Distributed Systems
Logical calculi for reasoning in the presence of uncertainty
Logical calculi for reasoning in the presence of uncertainty
Journal of Systems and Software
Hi-index | 0.00 |
Nonmonotonic logic is intended to apply specifically to situations where the initial information is incomplete. Using nonmonotonic reasoning procedures we shall be able to jump to conclusions, but withdraw them later when we gain additional information. A number of nonmonotonic logics have been introduced and widely discussed. Nonmonotonic logics tend to be introduced proof theoretically, and little attention is paid to their semantic characteristics or their computational tractability. We address both of these issues by presenting a nonmonotonic logic for the Herbrand subset of first-order predicate logic. This nonmonotonic logic is shown to be both sound and complete. Theories formulated in this logic can be executed in logic programming fashion.