96 search results - page 6 / 20 » An Optimization for Reasoning with Forest Logic Programs |
ICLP
1995
Springer
13 years 10 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
AI
2001
Springer
13 years 10 months ago
2001
Springer
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are no...
PPDP
2010
Springer
13 years 4 months ago
2010
Springer
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
SCCC
2005
IEEE
14 years 17 days ago
2005
IEEE
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...