Sciweavers

322 search results - page 13 / 65
» Combinations of Abstract Domains for Logic Programming
Sort
View
CP
2004
Springer
15 years 5 months ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
SUM
2009
Springer
15 years 6 months ago
Query Answering in Belief Logic Programming
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
Hui Wan, Michael Kifer
ILP
2007
Springer
15 years 5 months ago
Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...
Mark Goadrich, Jude W. Shavlik
LOPSTR
1994
Springer
15 years 3 months ago
Using Call/Exit Analysis for Logic Program Transformation
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
Dmitri Boulanger, Maurice Bruynooghe
ENTCS
2008
101views more  ENTCS 2008»
14 years 11 months ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump