Logic Programming and Non-monotonic Reasoning: Proceedings of the ... International WorkshopMIT Press, 1991 - Logic programming |
Contents
Autoepistemic Logics of Closed Beliefs and Logic | 3 |
T Przymusinski | 19 |
P Geerts and D Vermeir | 36 |
Copyright | |
17 other sections not shown
Other editions - View all
Common terms and phrases
abductive program Artificial Intelligence assumption set w.r.t. autoepistemic logic autoepistemic theory belief revision CA(S circumscription classical negation closed world assumption Consider consistent constraints corresponding cumulative default logic default theory defined Definition denote disjunctive embedded implications epistemic specification equivalent example extended logic programs extension class final Kripke model finite fixed point formalisms Gelfond Herbrand Horn clause implies inconsistent inference intuitionistic intuitively Konolige Kripke model language Lemma Lifschitz logic pro logic programs Marek minimal models modal logic monotonic Moore's NCFP negation as failure negative introspection non-monotonic reasoning nonmonotonic logic notion objective belief operator ordered theory P-stable predicate proof Przymusinski rational trees S-expansion satisfies semantics for logic set of formulas St(S stable autoepistemic expansion stable expansion stable model semantics stable semantics stable set stable theories stratified subset Theorem three-valued transform unique well-founded model well-founded semantics WF Model