96 search results - page 8 / 20 » An Optimization for Reasoning with Forest Logic Programs |
ICLP
2009
Springer
14 years 7 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
ICLP
1992
Springer
13 years 11 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
AICOM
2006
13 years 7 months ago
2006
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
LOPSTR
2004
Springer
14 years 11 days ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
PLDI
2011
ACM
12 years 9 months ago
2011
ACM
Translation validators are static analyzers that attempt to verify that program transformations preserve semantics. Normalizing translation validators do so by trying to match the...