Compiling a default reasoning system into Prolog

DOI10.1007/BF03037149zbMATH Open0713.68017OpenAlexW2081450921MaRDI QIDQ750134FDOQ750134

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

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

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)

Cites Work

• Title not available (Why is that?)
• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• A Prolog technology theorem prover: A new exposition and implementation in Prolog
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm to compute circumscription
• A logic for default reasoning
• Title not available (Why is that?)
• Title not available (Why is that?)
• A logical framework for default reasoning
• Algorithm = logic + control
• Title not available (Why is that?)
• Ordering conjunctive queries
• The semantics of induction and the possibility of complete systems of inductive inference
• Title not available (Why is that?)
• Solving large combinatorial problems in logic programming
• The occur-check problem in Prolog
• Eliminating the fixed predicates from a circumscription
• A circumscriptive theorem prover
• A methodology for using a default and abductive reasoning system
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• On prediction in Theorist
• Incorporating top-down information into bottom-up hypothetical reasoning
• A unifying view for logic programming with non-monotonic reasoning
• Skeptical query-answering in Constrained Default Logic
• Compositional model-theoretic semantics for logic programs
• Title not available (Why is that?)
• Linear resolution for consequence finding
• Defaults as restrictions on classical Hilbert-style proofs
• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• Modular specifications with supernormal defaults
• IDNAF Prolog
• Default reasoning by deductive planning
• Prolog technology for default reasoning: proof theory and compilation techniques
• 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)