scientific article; zbMATH DE number 4185010
From MaRDI portal
Publication:5750390
zbMath0718.68019MaRDI QIDQ5750390
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (37)
A three-valued semantics for deductive databases and logic programs ⋮ Reasoning about action. I: A possible worlds approach ⋮ Reasoning about action. II: The qualification problem ⋮ Nonmonotonic logic and temporal projection ⋮ On the relationship between circumscription and negation as failure ⋮ Stratification and knowledge base management ⋮ Circumscribing DATALOG: expressive power and complexity ⋮ Well-founded and stationary models of logic programs ⋮ Complexity and undecidability results for logic programming ⋮ Engineering and compiling planning domain models to promote validity and efficiency ⋮ Defaults in domain theory ⋮ Embedding circumscriptive theories in general disjunctive programs ⋮ Ramification and causality ⋮ General logical databases and programs: Default logic semantics and stratification ⋮ Three-valued nonmonotonic formalisms and semantics of logic programs ⋮ A non-reified temporal logic ⋮ Abstract minimality and circumscription ⋮ A theory of nonmonotonic inheritance based on annotated logic ⋮ The alternating fixpoint of logic programs with negation ⋮ A logic of knowledge and justified assumption ⋮ Static filtering on stratified programs ⋮ Graph properties for normal logic programs ⋮ How does a box work? A study in the qualitative dynamics of solid objects ⋮ Thirteen Definitions of a Stable Model ⋮ Circumscriptive theories: A logic-based framework for knowledge representation ⋮ Negation in rule-based database languages: A survey ⋮ Negation by default and unstratifiable logic programs ⋮ The logical foundations of goal-regression planning in autonomous agents ⋮ Indefinite abductive explanations ⋮ First-order stable model semantics with intensional functions ⋮ Twelve Definitions of a Stable Model ⋮ The expressive power of stratified logic programs ⋮ The complexity of predicate default logic over a countable domain ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ Extending and implementing the stable model semantics ⋮ Modeling a dynamic and uncertain world. I: Symbolic and probabilistic reasoning about change ⋮ Completeness results for circumscription
This page was built for publication:
