scientific article; zbMATH DE number 592370

No author found.

Publication date: 21 June 1994

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

nonmonotonic logic Logic programming Artificial intelligence autoepistemic logic Logic default logic nonmonotonic reasoning Nonmonotonic reasoning uncertain reasoning circumscription Uncertain reasoning defeasible logic possibility logic uncertainty logics

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to mathematical logic and foundations (03-00)

Related Items (only showing first 100 items - show all)

On representation theorems for nonmonotonic consequence relations ⋮ Fresh logic: Proof-theory and semantics for FM and nominal techniques ⋮ An algebraic approach to belief contraction and nonmonotonic entailment ⋮ Logical foundations and complexity of 4QL, a query language with unrestricted negation ⋮ Extracting Decision Rules from Qualitative Data Using Sugeno Integral: A Case-Study ⋮ Symbolic Possibilistic Logic: Completeness and Inference Methods ⋮ Operational semantics of Framed Tempura ⋮ Handling uncertainty and defeasibility in a possibilistic logic setting ⋮ Modal operators on pseudo-BE algebras ⋮ Redundancy in logic. III: Non-monotonic reasoning ⋮ Combining answer set programming with description logics for the semantic web ⋮ Semantic forgetting in answer set programming ⋮ Truth definitions in finite models ⋮ Probabilistic reasoning in a classical logic ⋮ Rethinking specificity in defeasible reasoning and its effect in argument reinstatement ⋮ LEG Networks for Ranking Functions ⋮ Inconsistency-tolerant reasoning over linear probabilistic knowledge bases ⋮ Adaptively applying modus ponens in conditional logics of normality ⋮ Higher-order narrowing with convergent systems ⋮ An extension of pointwise circumscription ⋮ From statistical knowledge bases to degrees of belief ⋮ Nonmonotonicity and answer set inference ⋮ Static and dynamic orderings on Dungean argumentation frameworks -- an overview ⋮ On manipulation in merging epistemic states ⋮ Possibilistic Semantics for a Modal KD45 Extension of Gödel Fuzzy Logic ⋮ A Survey of Ranking Theory ⋮ A sequent calculus for skeptical Default Logic ⋮ Recovering Consistency by Forgetting Inconsistency ⋮ Probabilities on sentences in an expressive logic ⋮ A logical framework for privacy-preserving social network publication ⋮ Graded inheritance nets for knowledge representation ⋮ Event calculus and temporal action logics compared ⋮ Beliefs in conditionals vs. conditional beliefs ⋮ REWARD VERSUS RISK IN UNCERTAIN INFERENCE: THEOREMS AND SIMULATIONS ⋮ Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change ⋮ A tableau calculus for minimal model reasoning ⋮ Relative expressiveness of defeasible logics ⋮ Nonmonotonic conditionals that behave like conditional probabilities above a threshold ⋮ Additive Consolidation with Maximal Change ⋮ Completing Symbolic Rule Bases Using Betweenness and Analogical Proportion ⋮ Fusion of Pedigreed Preferential Relations ⋮ A possibilistic-logic-based approach to integrating imprecise and uncertain information ⋮ Sequent calculus and data fusion ⋮ Shifting Priorities: Simple Representations for Twenty-Seven Iterated Theory Change Operators ⋮ On decision-theoretic foundations for defaults ⋮ Skepticism and floating conclusions ⋮ Fusion: General concepts and characteristics ⋮ Fusion: General concepts and characteristics ⋮ Introducing Reactive Kripke Semantics and Arc Accessibility ⋮ Connectives in Cumulative Logics ⋮ Shallow confluence of conditional term rewriting systems ⋮ On the consistency of rule bases based on lattice-valued first-order logic LF(X) ⋮ Computing Generalized Specificity ⋮ Seminormalizing a default theory ⋮ Some (in)translatability results for normal logic programs and propositional theories ⋮ Revising and updating using a back-up semantics ⋮ Rough Sets: From Rudiments to Challenges ⋮ A Panorama of Iterated Revision ⋮ Towards a Bayesian Theory of Second-Order Uncertainty: Lessons from Non-Standard Logics ⋮ Possibilistic nested logic programs and strong equivalence ⋮ Probabilistic Modeling of Default Reasoning ⋮ A simple logic for reasoning about incomplete knowledge ⋮ An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ Reconsideration of circumscriptive induction with pointwise circumscription ⋮ A logic programming framework for possibilistic argumentation: Formalization and logical properties ⋮ Logical handling of uncertain, ontology-based, spatial information ⋮ Two alternatives for handling preferences in qualitative choice logic ⋮ Propositional distances and compact preference representation ⋮ On Stein's paper: Resolving ambiguity in nonmonotonic inheritance hierarchies ⋮ A qualitative fuzzy possibilistic logic ⋮ Making the right exceptions ⋮ On the transformation between possibilistic logic bases and possibilistic causal networks ⋮ Possibilistic conditioning framed in fuzzy logics ⋮ Simplified Kripke semantics for K45-like Gödel modal logics and its axiomatic extensions ⋮ A formal fuzzy reasoning system and reasoning mechanism based on propositional modal logic ⋮ Reasoning under minimal upper bounds in propositional logic ⋮ Refinements of the maximum approach to decision-making in a fuzzy environment ⋮ Rudiments of rough sets ⋮ Adding similarity-based reasoning capabilities to a Horn fragment of possibilistic logic with fuzzy constants ⋮ Open answer set programming for the semantic web ⋮ Generalized possibilistic logic: foundations and applications to qualitative reasoning about uncertainty ⋮ Preferential reasoning in the perspective of Poole default logic ⋮ CP- and OCF-networks -- a comparison ⋮ Equational unification, word unification, and 2nd-order equational unification ⋮ System \(\text{Z}^{\text{FO}}\): default reasoning with system Z-like ranking functions for unary first-order conditional knowledge bases ⋮ Permission to speak: a logic for access control and conformance ⋮ Possibilistic reasoning -- a mini-survey and uniform semantics ⋮ Multi-interpretation operators and approximate classification. ⋮ Introducing reactive Kripke semantics and arc accessibility ⋮ Possibilistic reasoning with partially ordered beliefs ⋮ Extending possibilistic logic over Gödel logic ⋮ Abductive consequence relations ⋮ Tabulation proof procedures for fuzzy linguistic logic programming ⋮ An abstract, argumentation-theoretic approach to default reasoning ⋮ Defeasible inheritance on cyclic networks ⋮ Nonmonotonic reasoning, conditional objects and possibility theory ⋮ Compiling specificity into approaches to nonmonotonic reasoning ⋮ On the complexity of equational problems in CNF ⋮ Boolean algebras of conditionals, probability and logic ⋮ Supremum preserving upper probabilities

This page was built for publication: