AGP
2003
IEEE
13 years 10 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 ...
LPNMR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. 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...
INAP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This article merges two approaches: one dealing with persistence for logic programs, as provided by a relational database back-end and another which addresses the issues ...
ILP
2005
Springer
13 years 10 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
ASP
2005
Springer
13 years 10 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
ICECCS
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper formalizes the notion of a design model structurally conforming to a design pattern by representing the model as a logic program whilst the pattern as a query. The conf...
LOPSTR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
IDC
2009
Springer
13 years 11 months ago
2009
Springer
In the last fifteen years many work in logic programming has focussed on parallel implementations both in shared memory and in distributed memory multiprocessor systems. In both c...