An epistemic model of logic programming

DOI10.1007/BF03037512MaRDI QIDQ918192zbMATH OpenFDO

Authors Elsie Sterbin Gottlieb

Publication date 1990

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

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

zbMATH Keywords

logic programmingmodal logicsnegation as failurepossible-worlds semanticsresolution

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic programming (68N17) Knowledge representation (68T30)

Recommendations

• Belief, provability, and logic programs
• Autoepistemic circumscription and logic programming
• scientific article; zbMATH DE number 1761412
• About epistemic negation and world views in epistemic logic programs
• scientific article; zbMATH DE number 33417

Cites work

• A completeness theorem in modal logic
• A logic for default reasoning
• A Machine-Oriented Logic Based on the Resolution Principle
• All the Way with Wirtinger: A Short Proof of Bonnesen's Inequality
• Completely non-clausal theorem proving
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• scientific article; zbMATH DE number 4014675 (Why is no real title available?)
• scientific article; zbMATH DE number 4018413 (Why is no real title available?)
• scientific article; zbMATH DE number 4018414 (Why is no real title available?)
• scientific article; zbMATH DE number 3871318 (Why is no real title available?)
• scientific article; zbMATH DE number 4035208 (Why is no real title available?)
• scientific article; zbMATH DE number 3731310 (Why is no real title available?)
• scientific article; zbMATH DE number 3212004 (Why is no real title available?)
• Intensional logics and logical truth
• Linear resolution with selection function
• MOLOG: A system that extends PROLOG with modal logic
• On the relation between default and autoepistemic logic
• Prolegomena to a theory of mechanized formal reasoning
• Proof methods for modal and intuitionistic logics

Cited in

(23)

• Logic programming and reasoning with incomplete information
• A lightweight epistemic logic and its application to planning
• Logics for epistemic programs
• Evaluating epistemic negation in answer set programming
• scientific article; zbMATH DE number 5734950 (Why is no real title available?)
• Updating Epistemic Logic Programs
• Reasoning About Epistemic States of Agents by Modal Logic Programming
• Credibilistic programming. An introduction to models and applications
• scientific article; zbMATH DE number 33417 (Why is no real title available?)
• scientific article; zbMATH DE number 88995 (Why is no real title available?)
• A modal extension of logic programming: modularity, beliefs and hypothetical reasoning
• scientific article; zbMATH DE number 1761412 (Why is no real title available?)
• Logic programming with graded introspection
• scientific article; zbMATH DE number 10093 (Why is no real title available?)
• Situated Modeling of Epistemic Puzzles
• Belief, provability, and logic programs
• Trans-epistemic semantics for logic programs
• About epistemic negation and world views in epistemic logic programs
• A substructural epistemic resource logic: theory and modelling applications
• Deducing Logic Programs
• Logic Programming and Nonmonotonic Reasoning
• From epistemic norms to logical rules: epistemic models for logical expressivists
• An intensional epistemic logic

This page was built for publication: An epistemic model of logic programming

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