scientific article; zbMATH DE number 592368

No author found.

Publication date: 21 June 1994

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

Logic in artificial intelligence (68T27) 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) Other applications of logic (03B80)

Related Items

Systematic Refinement of Abstract State Machines with Higher-Order Logic ⋮ Unification for infinite sets of equations between finite terms ⋮ Sound generalizations in mathematical induction ⋮ Decidability of bounded second order unification ⋮ Extending uncertainty formalisms to linear constraints and other complex formalisms ⋮ Inducing inference relations from inconsistency measures ⋮ On the expressive power of TeamLTL and first-order team logic over hyperproperties ⋮ A behavioural model for vague probability assessments ⋮ Unnamed Item ⋮ A two-valued logic for properties of strict functional programs allowing partial functions ⋮ On the logic of causal explanation ⋮ Unification in commutative semigroups ⋮ Characterizing the principle of minimum cross-entropy within a conditional-logical framework ⋮ Deaccumulation techniques for improving provability ⋮ Plausible reasoning and plausibility monitoring in language comprehension ⋮ Uncertain lightweight ontologies in a product-based possibility theory framework ⋮ Representing action: indeterminacy and ramifications ⋮ On the measure of conflicts: Shapley inconsistency values ⋮ A postulate-driven study of logical argumentation ⋮ A quantitative approach to reasoning about incomplete knowledge ⋮ An abstract, argumentation-theoretic approach to default reasoning ⋮ A concept for the evolution of relational probabilistic belief states and the computation of their changes under optimum entropy semantics ⋮ Projection and scope-determined circumscription ⋮ What's right with a syntactic approach to theories and models? ⋮ On the Strong Completeness of Åqvist’s Dyadic Deontic Logic G ⋮ Solving conflicts in information merging by a flexible interpretation of atomic propositions ⋮ Decidability of bounded higher-order unification ⋮ The unification type of the Pythagorean equation in varieties of nilpotent rings ⋮ Bayesian network modelling through qualitative patterns ⋮ Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes) ⋮ A semantic framework for open processes ⋮ Properties and interrelationships of skeptical, weakly skeptical, and credulous inference induced by classes of minimal models ⋮ Paracoherent answer set computation ⋮ Reasoning with prioritized information by iterative aggregation of distance functions ⋮ Unification of concept terms in description logics ⋮ On the difference of Horn theories ⋮ Formalising the Fisherman's Folly puzzle ⋮ Possibility measures and possibility integrals defined on a complete lattice ⋮ Formalizing sensing actions -- a transition function based approach ⋮ Nonmonotonic reasoning by inhibition nets ⋮ Essential unifiers ⋮ Fuzzy temporal constraint logic: A valid resolution principle ⋮ Formalizing narratives using nested circumscription ⋮ Reasoning about actions: steady versus stabilizing state constraints ⋮ A decision algorithm for distributive unification ⋮ First-order stable model semantics with intensional functions ⋮ Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification ⋮ FTClogic: fuzzy temporal constraint logic ⋮ Source-tracking unification ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ The qualification problem: A solution to the problem of anomalous models ⋮ Using possibilistic logic for modeling qualitative decision: answer set programming algorithms ⋮ Fuzzy \(rr\)DFCSP and planning ⋮ Confluence without termination via parallel critical pairs