Pages that link to "Item:Q1173955"
From MaRDI portal
The following pages link to General logical databases and programs: Default logic semantics and stratification (Q1173955):
Displayed 25 items.
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Negation by default and unstratifiable logic programs (Q753501) (← links)
- Possibilistic uncertainty handling for answer set programming (Q854974) (← links)
- A note on the stable model semantics for logic programs (Q1127348) (← links)
- Three-valued nonmonotonic formalisms and semantics of logic programs (Q1182168) (← links)
- How complicated is the set of stable models of a recursive logic program? (Q1192346) (← links)
- Stable and extension class theory for logic programs and default logics (Q1197387) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning (Q1311405) (← links)
- Default theories that always have extensions (Q1337686) (← links)
- A theory of nonmonotonic rule systems I (Q1356221) (← links)
- Seminormal stratified default theories (Q1380425) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Well-founded and stationary models of logic programs (Q1924748) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Epistemology and artificial intelligence (Q2565612) (← links)
- Dealing Automatically with Exceptions by Introducing Specificity in ASP (Q3638184) (← links)
- On the impact of stratification on the complexity of nonmonotonic reasoning (Q4317728) (← links)
- Default Negation as Explicit Negation plus Update (Q5059691) (← links)
- Complexity results for abductive logic programming (Q5101437) (← links)
- A sphere world semantics for default reasoning (Q5101449) (← links)
- Reasoning with stratified default theories (Q5101456) (← links)