Searching for "Non-Horn Clause Logic Programming." – sorted by Relevance.
-
Complexity of Query Answering in Logic Databases with Complex Values
- of first-order logic. For non-Horn clause logic programs, decidability and complexity have been mainly
- Cited by 11 (5 self) – Add To MetaCart
-
Deductive Database Languages: Problems and Solutions
- fixpoint semantics [Gelder 1993]; nonHorn clause logic programs such as disjunctive deductive databases
- Cited by 18 (4 self) – Add To MetaCart
-
An Algebraic Approach to General Boolean Constraint Problems
- the problem means satisfying the formula, so, written this way, CSPs are forms of non-Horn-clause logic
- Cited by 1 (0 self) – Add To MetaCart
-
From Weak Satisfiability to n-Satisfiability on Hypergraphs
- to proposition 2.2, however, the increase in inconsistencies in a non-Horn clause program or database cannot
- Cited by 1 (0 self) – Add To MetaCart

