scientific article; zbMATH DE number 478394

From MaRDI portal
Publication:4273952

zbMath0784.03018MaRDI QIDQ4273952

Victor W. Marek, Miroslaw Truszczynski

Publication date: 8 December 1993


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

A context for belief revision: forward chaining-normal nonmonotonic rule systems, Nonmonotonic reasoning with multiple belief sets, Privacy Preservation Using Multi-context Systems and Default Logic, On the complexity of extension checking in default logic, Querying disjunctive databases through nonmonotonic logics, Default reasoning by deductive planning, Defaults with priorities, Multi-modal nonmonotonic logics of minimal knowledge, Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach, Redundancy in logic. III: Non-monotonic reasoning, Default theories over monadic languages, Seminormal stratified default theories, Complexity of computing with extended propositional logic programs, Algebraic semantics for modal and superintuitionistic non-monotonic logics, Revision programming, Abduction from logic programs: Semantics and complexity, Knowledge means ‘all’, belief means ‘most, A sphere world semantics for default reasoning, Skeptical rational extensions, Reasoning with stratified default theories, Trans-epistemic semantics for logic programs, Multi-interpretation operators and approximate classification., A Survey of the Proof-Theoretic Foundations of Logic Programming, Random logic programs: Linear model, Thirty years of Epistemic Specifications, A Logic Framework for P2P Deductive Databases, Definability and commonsense reasoning, Semantics and complexity of abduction from default theories, A sequent calculus for skeptical Default Logic, Proof complexity of propositional default logic, Specification of nonmonotonic reasoning, On the decidability and complexity of reasoning about only knowing, On the parameterized complexity of non-monotonic logics, Graph theoretical structures in logic programs and default theories, Annotated nonmonotonic rule systems, Relating Truth, Knowledge and Belief in Epistemic States, A survey of non-monotonic reasoning, Cumulativity Tailored for Nonmonotonic Reasoning, Logic programs with abstract constraint atoms: the role of computations, Symbolic knowledge extraction from trained neural networks: A sound approach, Nonmonotonic reasoning by inhibition nets, Some Rough Consequence Logics and their Interrelations, Automata and Answer Set Programming, Default logic and bounded treewidth, An argument-based approach to reasoning with specificity, Artificial nonmonotonic neural networks, Constraints on extensions of a default theory, Autoepistemic answer set programming, Strong Backdoors for Default Logic, The Complexity of Reasoning for Fragments of Default Logic, Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning, On the relation between default and modal nonmonotonic reasoning, Prolog technology for default reasoning: proof theory and compilation techniques, Recovery of (non)monotonic theories, Default logic generalized and simplified, On the relation among answer set solvers, A non-preferential semantics of non-monotonic modal logic, Hyperequivalence of logic programs with respect to supported models, Lexicographic priorities in default logic, A uniform tableaux method for nonmonotonic modal logics, A Unifying Approach for Nonmonotonic S4F, (Reflexive) Autoepistemic Logic, and Answer Set Programming, Semi-representability of default theories in rational default logic, Infinitary default logic for specification of nonmonotonic reasoning, Revising and updating using a back-up semantics, Combining Nonmonotonic Knowledge Bases with External Sources, Abductive reasoning through filtering, Is default logic a reinvention of inductive-statistical reasoning?, Logic programs, well-orderings, and forward chaining, Quo Vadis Answer Set Programming?, On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP, Approximation Schemes in Logic and Artificial Intelligence, Expressing preferences in default logic, Alternative foundations for Reiter's default logic, Default reasoning from conditional knowledge bases: Complexity and tractable cases, On the computational complexity of assumption-based argumentation for default reasoning., Propositional default logics made easier: computational complexity of model checking., Uniform semantic treatment of default and autoepistemic logics, More on representation theory for default logic, The complexity of predicate default logic over a countable domain, Logic programming and knowledge representation---The A-Prolog perspective, Fixed-parameter complexity in AI and nonmonotonic reasoning, Evaluating the effect of semi-normality on the expressiveness of defaults, A nonmonotonic observation logic