General logical databases and programs: Default logic semantics and stratification

From MaRDI portal
Publication:1173955

DOI10.1016/0890-5401(91)90073-BzbMath0800.68292MaRDI QIDQ1173955

Nicole Bidoit, Christine Froidevaux

Publication date: 25 June 1992

Published in: Information and Computation (Search for Journal in Brave)




Related Items (25)

Default theories that always have extensionsDefault Negation as Explicit Negation plus UpdateA theory of nonmonotonic rule systems IPossibilistic uncertainty handling for answer set programmingSeminormal stratified default theoriesPolynomial-time computable stable modelsA note on the stable model semantics for logic programsWell-founded and stationary models of logic programsOn the computational cost of disjunctive logic programming: Propositional caseAbduction from logic programs: Semantics and complexityComplexity results for abductive logic programmingA sphere world semantics for default reasoningReasoning with stratified default theoriesOn the impact of stratification on the complexity of nonmonotonic reasoningThree-valued nonmonotonic formalisms and semantics of logic programsGraph theoretical structures in logic programs and default theoriesHow complicated is the set of stable models of a recursive logic program?Stable and extension class theory for logic programs and default logicsNegation in rule-based database languages: A surveyNegation by default and unstratifiable logic programsDealing Automatically with Exceptions by Introducing Specificity in ASPExpressive power and complexity of partial models for disjunctive deductive databasesEpistemology and artificial intelligenceDualities between alternative semantics for logic programming and nonmonotonic reasoningLogic programming and knowledge representation---The A-Prolog perspective



Cites Work


This page was built for publication: General logical databases and programs: Default logic semantics and stratification