scientific article; zbMATH DE number 4185011
From MaRDI portal
Publication:5750391
zbMath0718.68020MaRDI QIDQ5750391
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
nonmonotonic reasoningclosed world assumptionnegation as failurenegation in logic programmingHorn programscompleted databasesfixpoint models
Related Items (37)
A three-valued semantics for deductive databases and logic programs ⋮ An algorithm for determining database consistency under the closed world assumption ⋮ A necessary condition for constructive negation in constraint logic programming ⋮ SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs ⋮ Intuitionistic three-valued logic and logic programming ⋮ Inferring negative information from disjunctive databases ⋮ Well-founded and stationary models of logic programs ⋮ Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning ⋮ Complexity and undecidability results for logic programming ⋮ Domain theory for nonmonotonic functions ⋮ On the strong completion of logic programs ⋮ Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete ⋮ Replacing unification by constraint satisfaction to improve logic program expressiveness ⋮ Semantics of structured normal logic programs ⋮ Between constructive mathematics and PROLOG ⋮ Three-valued completion for abductive logic programs ⋮ A logic for programming with complex objects ⋮ The alternating fixpoint of logic programs with negation ⋮ On the relations between stable and well-founded semantics of logic programs ⋮ Graph properties for normal logic programs ⋮ A transformation system for deductive database modules with perfect model semantics ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ Constructive negation and constraint logic programming with sets ⋮ Fuzzy logic programming ⋮ Generalized well-founded semantics for logic programs ⋮ Nonmonotonic Trust Management for P2P Applications ⋮ HR-SQL: extending SQL with hypothetical reasoning and improved recursion for current database systems ⋮ Programming in three-valued logic ⋮ Negation in rule-based database languages: A survey ⋮ Negation by default and unstratifiable logic programs ⋮ A semantics for modular general logic programs ⋮ Soundness of abductive proof procedure with respect to constraint for non-ground abducibles ⋮ A sound and complete semantics for a version of negation as failure ⋮ Weak generalized closed world assumption ⋮ A paraconsistent approach to actions in informationally complex environments ⋮ First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment ⋮ Is there an axiomatic semantics for standard pure Prolog?
This page was built for publication:
