Circumscription - a form of non-monotonic reasoning
From MaRDI portal
Publication:1140440
DOI10.1016/0004-3702(80)90011-9zbMath0435.68073OpenAlexW2945259913WikidataQ56224665 ScholiaQ56224665MaRDI QIDQ1140440
Publication date: 1980
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(80)90011-9
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, Closed-world databases and circumscription, Variable precision logic, The hypothetical syllogism, Dispositional logic, Preferences in artificial intelligence, On the computability of circumscription, A natural semantics for modal logic over databases, Reasoning about action. I: A possible worlds approach, Reasoning about action. II: The qualification problem, An approach to default reasoning based on a first-order conditional logic: Revised report, A generalization of the Lin-Zhao theorem, On the relation between default and autoepistemic logic, The anomalous extension problem in default reasoning, Autocircumscription, A first-order conditional logic for prototypical properties, Nonmonotonic logic and temporal projection, Reasoning under minimal upper bounds in propositional logic, Expert system models for inference with imperfect knowledge: A comparative study, A preferential semantics for causal reasoning about action, Efficient reasoning about rich temporal domains, On the relationship between circumscription and negation as failure, An algorithm to compute circumscription, A generalization of collapsible cases of circumscription, The importance of open and recursive circumscription, Results on translating defaults to circumscription, Eliminating the fixed predicates from a circumscription, Minimalism, justification and non-monotonicity in deductive databases, A circumscriptive theorem prover, Reasoning with minimal models: efficient algorithms and applications, A note on the stable model semantics for logic programs, Circumscribing DATALOG: expressive power and complexity, Tableau systems for paraconsistency and minimal inconsistency, The logic of empirical theories revisited, Brain-like computing based on distributed representations and neurodynamics, Inductive equivalence in clausal logic and nonmonotonic logic programming, Semantic characterization of rational closure: from propositional logic to description logics, Semantic-based construction of arguments: an answer set programming approach, Projection and scope-determined circumscription, Abnormality and randomness, On the associations between variables in expert systems including default relations, Between constructive mathematics and PROLOG, General logical databases and programs: Default logic semantics and stratification, Nonmonotonic reasoning, preferential models and cumulative logics, On the number of minimal transversals in 3-uniform hypergraphs, Defeasible conditionalization, Nonmonotonic reasoning in the framework of situation calculus, Impediments to universal preference-based default theories, Three-valued nonmonotonic formalisms and semantics of logic programs, On the tractability of minimal model computation for some CNF theories, On the parameterized complexity of non-monotonic logics, The theory of nomic probability, On-line algorithms for satisfiability problems with uncertainty, Graded hypothesis theories, Nonmonotonicity and the scope of reasoning, Knowledgebase transformations, Abstract minimality and circumscription, An efficient method for eliminating varying predicates from a circumscription, Circumscription: Completeness reviewed, Recursively indefinite databases, The complexity of circumscriptive inference in Post's lattice, Trichotomies in the complexity of minimal inference, On the counting complexity of propositional circumscription, Simulation refinement for concurrency verification, John McCarthy's legacy, \(\mathcal M\)odular-\(\mathcal E\) and the role of elaboration tolerance in solving the qualification problem, A unifying action calculus, Iterated belief change in the situation calculus, Stable models and circumscription, Semantics and complexity of recursive aggregates in answer set programming, How does a box work? A study in the qualitative dynamics of solid objects, Formalising the Fisherman's Folly puzzle, From systems to logic in the early development of nonmonotonic reasoning, McCarthy variations in a modal key, Monadic second-order model-checking on decomposable matroids, A theorem on the consistency of circumscription, Using approximate reasoning to represent default knowledge, Decidability and definability with circumscription, Conditional entailment: bridging two approaches to default reasoning., A new default theories compilation for MSP-entailment, Modeling generalized implicatures using non-monotonic logics, Negation in rule-based database languages: A survey, The semantics of incomplete databases as an expression of preferences, My work with Victor Marek: a mathematician looks at answer set programming, Inductive situation calculus, A computational approach to fuzzy quantifiers in natural languages, Some representational issues in default reasoning, Foundations of a functional approach to knowledge representation, Saturation, nonmonotonic reasoning and the closed-world assumption, Plausible inferences and plausible reasoning, Automated inferencing, Evaluating the effect of semi-normality on the expressiveness of defaults, Reconstructing force-dynamic models from video sequences, Nonmonotonic causal theories, Elaboration tolerance through object-orientation, Reasoning with infinite stable models, Qualitative choice logic, On the satisfiability of circumscription, Completeness results for circumscription, Foundation of logic programming based on inductive definition, The complexity of propositional closed world reasoning and circumscription, Justification and defeat, Conditional logics of normality: A modal approach, Formalizing incomplete knowledge in incomplete databases, The complexity of minimal satisfiability problems, Motivated action theory: A formal theory of causal reasoning, A note on a description logic of concept and role typicality for defeasible reasoning over ontologies, Possible world semantics and autoepistemic reasoning, A tableau prover for domain minimization, Tableau-based characterization and theorem proving for default logic, An alternative approach to the semantics of disjunctive logic programs and deductive databases, Modality and interrupts, Issues in commonsense set theory, Autonomous agents modelling other agents: a comprehensive survey and open problems, Argument strength in probabilistic argumentation using confirmation theory, Deontic logic as founded on nonmonotonic logic, Counterfactual reasoning by (means of) defaults, Disjunctive \(LP+\) integrity constraints = stable model semantics., A theory of nonmonotonic rule systems I, Modal logic for default reasoning, The inheritance of dynamic and deontic integrity constraints or: Does the boss have more rights?, Circumscriptive semantics for updating knowledge bases, Network languages for intelligent control, Network languages for concurrent multiagent systems, On computing minimal models, The complexity of minimum partial truth assignments and implication in negation-free formulae, Prima facie and seeming duties, ECWA made easy, Static semantics for normal and disjunctive logic programs, Well-founded and stationary models of logic programs, Complexity and undecidability results for logic programming, On the computational cost of disjunctive logic programming: Propositional case, Explanatory diagnoses and their characterization by circumscription, Logic programming and reasoning with incomplete information, A graded approach to database repair by context-aware distance semantics, Autoepistemic logic of knowledge and beliefs, Abduction from logic programs: Semantics and complexity, On compact representations of propositional circumscription, The place of logic in reasoning, Defaults in domain theory, Causality as a key to the frame problem, Sound and efficient closed-world reasoning for planning, Permissive planning: Extending classical planning to uncertain task domains., Ramification and causality, An abstract, argumentation-theoretic approach to default reasoning, Definability and commonsense reasoning, Reducing belief revision to circumscription (and vice versa), Compiling specificity into approaches to nonmonotonic reasoning, Brave induction: a logical framework for learning from incomplete information, 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, Enhancing context knowledge repositories with justifiable exceptions, The relationship between stable, supported, default and autoepistemic semantics for general logic programs, Linear resolution for consequence finding, On the complexity of propositional knowledge base revision, updates, and counterfactuals, A logic of knowledge and justified assumption, Implicit and explicit stances in logic, The complexity of model checking for circumscriptive formulae, Exhaustive interpretation of complex sentences, Semantics for a theory of defeasible reasoning, Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics, Local logics, non-monotonicity and defeasible argumentation, \(Log_A\mathbf{G}\): an algebraic non-monotonic logic for reasoning with graded propositions, Miracles in formal theories of action, Prioritised fuzzy constraint satisfaction problems: Axioms, instantiation and validation, Circumscriptive theories: A logic-based framework for knowledge representation, The value of the four values, On first-order conditional logics, The expressive power of circumscription, Inheritance comes of age: applying nonmonotonic techniques to problems in industry, From environments to representations -- a mathematical theory of artificial perceptions, Lexicographic priorities in default logic, A general scheme for formalizing defaults using the predicate \(ab(I,S)\), Semantical and computational aspects of Horn approximations, The complexity of belief update, Note about cardinality-based circumscription, Non-monotonic fuzzy reasoning, Is default logic a reinvention of inductive-statistical reasoning?, To preference via entrenchment, The open logic and its relation to circumscription, Graph-based construction of minimal models, Prioritized logic programming and its application to commonsense reasoning, 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., Preprocessing of intractable problems, Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge, A circumscriptive calculus of events, A comparative study of open default theories, On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games, Autoepistemic circumscription and logic programming, First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment, Sequent calculi for choice logics, The complexity of predicate default logic over a countable domain, Logic programming and knowledge representation---The A-Prolog perspective, Extending and implementing the stable model semantics, SET-VAR, The qualification problem: A solution to the problem of anomalous models, Translations of network languages, Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming, Sequent-type rejection systems for finite-valued non-deterministic logics, The inverse satisfiability problem, On-line algorithms for satisfiability problems with uncertainty, On decision-theoretic foundations for defaults, An argument-based approach to reasoning with specificity, Dynamic Reasoning Systems, Contextual reasoning distilled, Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete, Stable Models for Temporal Theories, To Vladimir Lifschitz on His 65th Birthday, Lifschitz and Circumscription, Semantic interpolation, Modal logic based theory for non-monotonic reasoning, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, OBLIGATION, FREE CHOICE, AND THE LOGIC OF WEAKEST PERMISSIONS, Representation results for non-cumulative logics, A skeptical theory of inheritance in nonmonotonic semantic networks, Model-preference default theories, On a rule-based interpretation of default conditionals, Redundancy in logic. III: Non-monotonic reasoning, Semantic forgetting in answer set programming, Outlier detection using default reasoning, Notes on change and nonmonotony, Information and evidence in logic systems, Answering atomic queries in indefinite deductive databases, Meeting of the Association for Symbolic Logic, Campinas, Brazil, 1985, Adaptively applying modus ponens in conditional logics of normality, Algebraic semantics for modal and superintuitionistic non-monotonic logics, Argument strength in probabilistic argumentation based on defeasible rules, Probabilistic Event Calculus for Event Recognition, Inductive learning and defeasible inference, Two simple characterizations of well-founded semantics, Modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set Programming, History of circumscription, Integrity constraints in OWL ontologies based on grounded circumscription, An extension of pointwise circumscription, From statistical knowledge bases to degrees of belief, Embedding circumscriptive theories in general disjunctive programs, Model enumeration in propositional circumscription via unsatisfiable core analysis, Branching vs. Linear Time: Semantical Perspective, Combining UML and ontology: an exploratory survey, Is there an alternative to parsimonious semantics?, Epistemology Without Knowledge and Without Belief, A sequent calculus for skeptical Default Logic, Unnamed Item, Foundations of everyday practical reasoning, Unnamed Item, Unnamed Item, Unnamed Item, Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints, Implementing Prioritized Circumscription by Computing Disjunctive Stable Models, Dynamics of inductive inference in a unified framework, Free choice reasons, Circumscription within monotonic inferences, LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES, Formalizing GDPR provisions in reified I/O logic: the DAPRECO knowledge base, Event calculus and temporal action logics compared, Dialectic proof procedures for assumption-based, admissible argumentation, Loop formulas for circumscription, An incremental algorithm for generating all minimal models, Sequent calculi for default and autoepistemic logics, Minimal predicates, fixed-points, and definability, Nonmonotonic reasoning based on incomplete logic, Theorem proving techniques for view deletion in databases, Counterfactuals, A dissimilarity-based framework for generating inconsistency-tolerant logics, A survey of non-monotonic reasoning, A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence, Thirteen Definitions of a Stable Model, On the equivalence of the static and disjunctive well-founded semantics and its computation, Temporal representation and reasoning in artificial intelligence: A review, Annotation theories over finite graphs, Distance-based paraconsistent logics, All I know: A study in autoepistemic logic, Information tradeoffs in model building: A network routing application, Embedding prioritized circumscription in disjunctive logic programs, A sound and complete proof theory for the generalized logic of only knowing, A GENERALIZED VIEW OF NONMONOTONIC KNOWLEDGE: A SET OF THEORETIC PERSPECTIVE, On rational entailment for propositional typicality logic, Conservative query normalization on parallel circumscription, EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface, Gelfond-Zhang aggregates as propositional formulas, Strong Backdoors for Default Logic, Complex optimization in answer set programming, The Complexity of Reasoning for Fragments of Default Logic, A Tableau Calculus for Minimal Modal Model Generation, Reasoning with different levels of uncertainty, Remedial interchange, contrary-to-duty obligation and commutation, Second-order reasoning in description logics, Approximate databases: a support tool for approximate reasoning, Strong and explicit negation in non-monotonic reasoning and logic programming, Only persistence makes nonmonotonicity monotonous, Reasoning with Uncertainty in Deductive Databases and Logic Programs, Subtractive reductions and complete problems for counting complexity classes, Any-world assumptions in logic programming, Twelve Definitions of a Stable Model, Partial Functions and Equality in Answer Set Programming, Program Correspondence under the Answer-Set Semantics: The Non-ground Case, Safe Formulas in the General Theory of Stable Models (Preliminary Report), Logic and Complexity in Cognitive Science, ON PROOFS IN SYSTEM P, A logic for inductive probabilistic reasoning, Revisiting Grounded Circumscription in Description Logics, Probabilistic Modeling of Default Reasoning, Explaining by evidence
Cites Work
