551 search results - page 2 / 111 » {log}: A Logic Programming Language with Finite Sets |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have...
CP
2006
Springer
13 years 9 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
ICALP
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
ICLP
2009
Springer
14 years 6 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...
ICALP
1991
Springer
13 years 9 months ago
1991
Springer
