Compiling a default reasoning system into Prolog

DOI10.1007/BF03037149MaRDI QIDQ750134zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 1991

Published in New Generation Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03037149

zbMATH Keywords

implementationtheorem provingdefault reasoningTheoristabductive

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17) Theory of compilers and interpreters (68N20)

Recommendations

• Prolog technology for default reasoning: proof theory and compilation techniques
• scientific article; zbMATH DE number 2079775
• scientific article; zbMATH DE number 1630028
• Logic Programming with Defaults and Argumentation Theories
• A correct logic programming computation of default logic extensions
• scientific article; zbMATH DE number 4106291
• scientific article; zbMATH DE number 572196
• scientific article; zbMATH DE number 1950443
• scientific article; zbMATH DE number 587821

Cites work

• scientific article; zbMATH DE number 3947593 (Why is no real title available?)
• scientific article; zbMATH DE number 3958694 (Why is no real title available?)
• scientific article; zbMATH DE number 3984612 (Why is no real title available?)
• scientific article; zbMATH DE number 4053069 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 67497 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 194618 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• A Prolog technology theorem prover: A new exposition and implementation in Prolog
• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• A circumscriptive theorem prover
• A logic for default reasoning
• A logical framework for default reasoning
• A methodology for using a default and abductive reasoning system
• Algorithm = logic + control
• An algorithm to compute circumscription
• Eliminating the fixed predicates from a circumscription
• Ordering conjunctive queries
• Solving large combinatorial problems in logic programming
• The occur-check problem in Prolog
• The semantics of induction and the possibility of complete systems of inductive inference

Cited in

(14)

• Compositional model-theoretic semantics for logic programs
• Modular specifications with supernormal defaults
• IDNAF Prolog
• Linear resolution for consequence finding
• Skeptical query-answering in Constrained Default Logic
• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• On prediction in Theorist
• Incorporating top-down information into bottom-up hypothetical reasoning
• scientific article; zbMATH DE number 4195155 (Why is no real title available?)
• Defaults as restrictions on classical Hilbert-style proofs
• Default reasoning by deductive planning
• Prolog technology for default reasoning: proof theory and compilation techniques
• A unifying view for logic programming with non-monotonic reasoning
• \(\mathsf{XRay}\): a Prolog technology theorem prover for default reasoning: a system description

This page was built for publication: Compiling a default reasoning system into Prolog

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750134)