scientific article; zbMATH DE number 140388
From MaRDI portal
Publication:4028795
zbMATH Open0766.68127MaRDI QIDQ4028795FDOQ4028795
Authors: Halina Przymusinska, Vladimir Lifschitz, Mirosław Truszczyński, Michael Gelfond 
Publication date: 28 March 1993
Title of this publication is not available (Why is that?)
Recommendations
Cited In (35)
- Reasoning with power defaults
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
- On the relation between default and modal nonmonotonic reasoning
- Assumption-based argumentation for extended disjunctive logic programming
- Free choice reasons
- Rule Calculus: Semantics, Axioms and Applications
- Disjunction as alternative choices
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- A logic of knowledge and justified assumption
- Operational concepts of nonmonotonic logics. I: Default logic
- Title not available (Why is that?)
- Deontic logic as founded on nonmonotonic logic
- Reasoning by cases in Default Logic
- Skeptical rational extensions
- Reasoning with minimal models: efficient algorithms and applications
- Operational characterization of extensions in some logics for default reasoning
- Cumulativity Tailored for Nonmonotonic Reasoning
- Title not available (Why is that?)
- Default logic generalized and simplified
- Title not available (Why is that?)
- Update by means of inference rules
- Lexicographic priorities in default logic
- Graph theoretical structures in logic programs and default theories
- Prolog technology for default reasoning: proof theory and compilation techniques
- Semi-representability of default theories in rational default logic
- DISJUNCTIVITY
- Polynomial-time computable stable models
- Semantics and complexity of abduction from default theories
- Disjunctive Rule Lists
- Default logic and bounded treewidth
- Relating minimal models and pre-requisite-free normal defaults
- A causal approach to nonmonotonic reasoning
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
- Graph-based construction of minimal models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028795)
