8232 search results - page 90 / 1647 » Dynamic Logic Programming |
150
Voted
AGP
2003
IEEE
15 years 7 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
APLAS
2005
ACM
15 years 8 months ago
2005
ACM
124
Voted
JELIA
2010
Springer
15 years 1 months ago
2010
Springer
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
135
click to vote
LPNMR
2001
Springer
15 years 7 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
213
Voted
POPL
1999
ACM
15 years 6 months ago
1999
ACM
hought of as abstract interpretation for the heap How we talk about the heap Program var X points to U that has an N field pointing to V We use first order predicate logic ¡...