606 search results - page 54 / 122 » Constraint Hierarchies and Logic Programming |
LPNMR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
TVLSI
2002
13 years 8 months ago
2002
Abstract--We introduce the notion of energy-scalable systemdesign. The principal idea is to maximize computational quality for a given energy constraint at all levels of the system...
ILP
2005
Springer
14 years 2 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...
ICLP
1997
Springer
14 years 1 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
LICS
1995
IEEE
14 years 18 days ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...