551 search results - page 2 / 111 » {log}: A Logic Programming Language with Finite Sets |
154
Voted
CORR
2010
Springer
15 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...
174
Voted
CP
2006
Springer
15 years 10 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...
152
click to vote
ICALP
2009
Springer
15 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.
258
click to vote
ICLP
2009
Springer
16 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...
132
Voted
ICALP
1991
Springer
15 years 9 months ago
1991
Springer
