3481 search results - page 58 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
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, ...
ICLP
2009
Springer
14 years 9 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
JLP
2000
13 years 8 months ago
2000
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...
ICLP
2007
Springer
14 years 3 months ago
2007
Springer
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...
JELIA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We present the design of our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most featu...