Semantical considerations on nonmonotonic logic
From MaRDI portal
Publication:1060866
DOI10.1016/0004-3702(85)90042-6zbMath0569.68079OpenAlexW1966552757WikidataQ29042550 ScholiaQ29042550MaRDI QIDQ1060866
Publication date: 1985
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(85)90042-6
Modal logic (including the logic of norms) (03B45) Philosophical and critical aspects of logic and foundations (03A05) Abstract data types; algebraic specification (68Q65) Artificial intelligence (68T99)
Related Items
Robust reasoning with rules that have exceptions: From second-order probability to argumentation via upper envelopes of probability and possibility plus directed graphs ⋮ Minimal knowledge problem: A new approach ⋮ The epistemic structure of a theory of a game ⋮ Unifying default reasoning and belief revision in a modal framework ⋮ Conditional logics of normality: A modal approach ⋮ Limited reasoning in first-order knowledge bases ⋮ Possible world semantics and autoepistemic reasoning ⋮ Universe of discourse and existence ⋮ Autoepistemic logic programming ⋮ Autoepistemic logic of first order and its expressive power ⋮ Preferences in artificial intelligence ⋮ Querying disjunctive databases through nonmonotonic logics ⋮ Interpretations of open default theories in non-monotonic logics ⋮ Counterfactual reasoning by (means of) defaults ⋮ Modelling default and likelihood reasoning as probabilistic reasoning. ⋮ Languages with self-reference. II: Knowledge, belief, and modality ⋮ A theory of nonmonotonic rule systems I ⋮ Modal logic for default reasoning ⋮ A natural semantics for modal logic over databases ⋮ Reasoning about action. I: A possible worlds approach ⋮ Safe inductions and their applications in knowledge representation ⋮ On the relation between default and autoepistemic logic ⋮ A logical framework for default reasoning ⋮ Autocircumscription ⋮ A first-order conditional logic for prototypical properties ⋮ Efficient reasoning about rich temporal domains ⋮ On the relationship between circumscription and negation as failure ⋮ An algorithm to compute circumscription ⋮ Eliminating the fixed predicates from a circumscription ⋮ Multi-valued autoepistemic logic ⋮ Polynomial-time computable stable models ⋮ A modal contrastive logic: The logic of ``but ⋮ Generalized possibilistic logic: foundations and applications to qualitative reasoning about uncertainty ⋮ Autoepistemic logic of knowledge and beliefs ⋮ Abduction from logic programs: Semantics and complexity ⋮ Semantical considerations on multiagent only knowing ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ Fixpoint semantics for active integrity constraints ⋮ Well-founded semantics for defeasible logic ⋮ Logic programming as classical inference ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ An abstract, argumentation-theoretic approach to default reasoning ⋮ Dynamic reasoning with qualified syllogisms ⋮ Definability and commonsense reasoning ⋮ Compiling specificity into approaches to nonmonotonic reasoning ⋮ General logical databases and programs: Default logic semantics and stratification ⋮ Impediments to universal preference-based default theories ⋮ The effect of knowledge on belief: Conditioning, specificity and the lottery paradox in default reasoning ⋮ Three-valued nonmonotonic formalisms and semantics of logic programs ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ On the parameterized complexity of non-monotonic logics ⋮ A general framework for reason maintenance ⋮ Nonmonotonicity and the scope of reasoning ⋮ What does a conditional knowledge base entail? ⋮ Resolving ambiguity in nonmonotonic inheritance hierarchies ⋮ An explication of reasoning in multiple inheritance systems through non- monotonic Horn clause logic ⋮ On the autoepistemic reconstruction of logic programming ⋮ Skeptical reason maintenance and belief revision ⋮ The relationship between stable, supported, default and autoepistemic semantics for general logic programs ⋮ The alternating fixpoint of logic programs with negation ⋮ On the complexity of propositional knowledge base revision, updates, and counterfactuals ⋮ A logic of knowledge and justified assumption ⋮ John McCarthy's legacy ⋮ Iterated belief change in the situation calculus ⋮ Stable models and circumscription ⋮ From answer set logic programming to circumscription via logic of GK ⋮ Semantics and complexity of recursive aggregates in answer set programming ⋮ Semantics for a theory of defeasible reasoning ⋮ Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics ⋮ Using approximate reasoning to represent default knowledge ⋮ Conditional entailment: bridging two approaches to default reasoning. ⋮ Negation in rule-based database languages: A survey ⋮ Negation by default and unstratifiable logic programs ⋮ Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning ⋮ On the relation between default and modal nonmonotonic reasoning ⋮ On first-order conditional logics ⋮ Inheritance comes of age: applying nonmonotonic techniques to problems in industry ⋮ My work with Victor Marek: a mathematician looks at answer set programming ⋮ Default logic generalized and simplified ⋮ A non-preferential semantics of non-monotonic modal logic ⋮ Hyperequivalence of logic programs with respect to supported models ⋮ Argumentation in artificial intelligence ⋮ Lexicographic priorities in default logic ⋮ Is default logic a reinvention of inductive-statistical reasoning? ⋮ The computational complexity of ideal semantics ⋮ Default reasoning from conditional knowledge bases: Complexity and tractable cases ⋮ On the computational complexity of assumption-based argumentation for default reasoning. ⋮ Uniform semantic treatment of default and autoepistemic logics ⋮ On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games ⋮ Dualities between alternative semantics for logic programming and nonmonotonic reasoning ⋮ Autoepistemic circumscription and logic programming ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ Extending and implementing the stable model semantics ⋮ Modal logics for qualitative possibility theory ⋮ Evaluating the effect of semi-normality on the expressiveness of defaults ⋮ Agent-oriented epistemic reasoning: Subjective conditions of knowledge and belief ⋮ Introduction: Progress in formal commonsense reasoning ⋮ Reasoning with infinite stable models ⋮ Qualitative choice logic ⋮ On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ To Vladimir Lifschitz on His 65th Birthday ⋮ From Turner’s Logic of Universal Causation to the Logic of GK ⋮ Lifschitz and Circumscription ⋮ The Truth about Defaults ⋮ A decision method for nonmonotonic reasoning based on autoepistemic reasoning ⋮ Modality and interrupts ⋮ Handling database updates in two-dimensional temporal logic ⋮ Modal logic based theory for non-monotonic reasoning ⋮ A new methodology for query answering in default logics via structure-oriented theorem proving ⋮ Characterising equilibrium logic and nested logic programs: Reductions and complexity, ⋮ Representation results for non-cumulative logics ⋮ A rational reconstruction of nonmonotonic truth maintenance systems ⋮ A skeptical theory of inheritance in nonmonotonic semantic networks ⋮ Multi-modal nonmonotonic logics of minimal knowledge ⋮ Belief revision, conditional logic and nonmonotonic reasoning ⋮ Semantic forgetting in answer set programming ⋮ Measures of uncertainty in expert systems ⋮ Default reasoning using classical logic ⋮ Limited reasoning in first-order knowledge bases with full introspection ⋮ Belief, provability, and logic programs ⋮ Honesty in partial logic ⋮ Labellings for assumption-based and abstract argumentation ⋮ Static semantics for normal and disjunctive logic programs ⋮ Well-founded and stationary models of logic programs ⋮ Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning ⋮ On the computational cost of disjunctive logic programming: Propositional case ⋮ Logic programming and reasoning with incomplete information ⋮ Modal nonmonotonic logics demodalized ⋮ Algebraic semantics for modal and superintuitionistic non-monotonic logics ⋮ Paraconsistent constructive logic with strong negation as a contraction-free relevant logic ⋮ In search of a ``true logic of knowledge: the nonmonotonic perspective ⋮ The place of logic in reasoning ⋮ Autoepistemic logic revisited ⋮ On embedding default logic into Moore's autoepistemic logic ⋮ From statistical knowledge bases to degrees of belief ⋮ Default consequence relations as a logical framework for logic programs ⋮ Stable classes and operator pairs for disjunctive programs ⋮ On the impact of stratification on the complexity of nonmonotonic reasoning ⋮ Relating only knowing to minimal belief and negation as failure ⋮ Characterizing and extending answer set semantics using possibility theory ⋮ Sequent-type rejection systems for finite-valued non-deterministic logics ⋮ Thirty years of Epistemic Specifications ⋮ Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting ⋮ On the progression of belief ⋮ A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption ⋮ Unnamed Item ⋮ Talkin'bout consistency, or: When logically possible becomes possible ⋮ Skeptical query-answering in Constrained Default Logic ⋮ On the semantics of the unknown ⋮ Dialectic proof procedures for assumption-based, admissible argumentation ⋮ Knowledge and communication: A first-order theory ⋮ Contextual hypotheses and semantics of logic programs ⋮ On the decidability and complexity of reasoning about only knowing ⋮ A modal logic for subjective default reasoning ⋮ REWARD VERSUS RISK IN UNCERTAIN INFERENCE: THEOREMS AND SIMULATIONS ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ Sequent calculi for default and autoepistemic logics ⋮ Nonmonotonic reasoning based on incomplete logic ⋮ Unnamed Item ⋮ A survey of non-monotonic reasoning ⋮ A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence ⋮ Cumulativity Tailored for Nonmonotonic Reasoning ⋮ An epistemic approach to nondeterminism: believing in the simplest course of events ⋮ Thirteen Definitions of a Stable Model ⋮ Temporal agent programs ⋮ What might be the case after a change in view ⋮ Embedding prioritized circumscription in disjunctive logic programs ⋮ A sound and complete proof theory for the generalized logic of only knowing ⋮ Studying properties of classes of default logics ⋮ Argumentation Theory and Decision Aiding ⋮ An argument-based approach to reasoning with specificity ⋮ Determining inference semantics for disjunctive logic programs ⋮ Splitting Epistemic Logic Programs ⋮ Autoepistemic answer set programming ⋮ Embedding Logics in the Local Computation Framework ⋮ Programming with Annotated Logics ⋮ Strong Backdoors for Default Logic ⋮ Reasoning credulously and skeptically within a single extension ⋮ Unnamed Item ⋮ A Semantical Account of Progression in the Presence of Defaults ⋮ A Simple Modal Logic for Reasoning about Revealed Beliefs ⋮ Remedial interchange, contrary-to-duty obligation and commutation ⋮ A uniform tableaux method for nonmonotonic modal logics ⋮ A Unifying Approach for Nonmonotonic S4F, (Reflexive) Autoepistemic Logic, and Answer Set Programming ⋮ Strong and explicit negation in non-monotonic reasoning and logic programming ⋮ Reasoning with Uncertainty in Deductive Databases and Logic Programs ⋮ Any-world assumptions in logic programming ⋮ Disjunctive logic programs, answer sets, and the cut rule ⋮ Twelve Definitions of a Stable Model ⋮ The case for psychologism in default and inheritance reasoning ⋮ Non-monotonic reasoning from an evolution-theoretic perspective: Ontic, logical and cognitive foundations ⋮ In search of a ``true logic of knowledge: The nonmonotonic perspective ⋮ Sequent calculi for choice logics ⋮ Probabilistic Modeling of Default Reasoning ⋮ A simple logic for reasoning about incomplete knowledge
Cites Work
