General logical databases and programs: Default logic semantics and stratification
From MaRDI portal
Cites work
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Horn clause queries and generalizations
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 4199654 (Why is no real title available?)
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 194376 (Why is no real title available?)
- scientific article; zbMATH DE number 4185010 (Why is no real title available?)
- Minimalism, justification and non-monotonicity in deductive databases
- Negation as inconsistency. I
- Non-monotonic logic. I
- On the declarative and procedural semantics of logic programs
- Results on translating defaults to circumscription
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Semantical considerations on nonmonotonic logic
Cited in
(26)- A note on the stable model semantics for logic programs
- Three-valued nonmonotonic formalisms and semantics of logic programs
- How complicated is the set of stable models of a recursive logic program?
- Stable and extension class theory for logic programs and default logics
- Expressive power and complexity of partial models for disjunctive deductive databases
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- Default theories that always have extensions
- A theory of nonmonotonic rule systems I
- Seminormal stratified default theories
- Polynomial-time computable stable models
- Abduction from logic programs: Semantics and complexity
- Logic programming and knowledge representation---The A-Prolog perspective
- Well-founded and stationary models of logic programs
- On the computational cost of disjunctive logic programming: Propositional case
- Epistemology and artificial intelligence
- Dealing Automatically with Exceptions by Introducing Specificity in ASP
- On the impact of stratification on the complexity of nonmonotonic reasoning
- Default Negation as Explicit Negation plus Update
- Complexity results for abductive logic programming
- A sphere world semantics for default reasoning
- Reasoning with stratified default theories
- Update programs versus revision programs
- Graph theoretical structures in logic programs and default theories
- Negation in rule-based database languages: A survey
- Negation by default and unstratifiable logic programs
- Possibilistic uncertainty handling for answer set programming
This page was built for publication: General logical databases and programs: Default logic semantics and stratification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173955)
