3481 search results - page 102 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
123
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
135
click to vote
ICLP
2003
Springer
15 years 8 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
140
click to vote
ALT
2004
Springer
16 years 5 days ago
2004
Springer
Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integratio...
127
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
123
click to vote
ISSTA
2004
ACM
15 years 8 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...