An epistemic model of logic programming

DOI10.1007/BF03037512zbMath0705.68031MaRDI QIDQ918192

Elsie Sterbin Gottlieb

Publication date: 1990

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

zbMATH Keywords

resolutionlogic programmingmodal logicspossible-worlds semanticsnegation as failure

Mathematics Subject Classification ID

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

Related Items

An intensional epistemic logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof methods for modal and intuitionistic logics
• MOLOG: A system that extends PROLOG with modal logic
• On the relation between default and autoepistemic logic
• A logic for default reasoning
• Prolegomena to a theory of mechanized formal reasoning
• Completely non-clausal theorem proving
• Linear resolution with selection function
• Intensional logics and logical truth
• A completeness theorem in modal logic
• All the Way with Wirtinger: A Short Proof of Bonnesen's Inequality
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• A Machine-Oriented Logic Based on the Resolution Principle

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