4192 search results - page 127 / 839 » Probabilistic Logic Programming |
117
Voted
PPDP
2001
Springer
15 years 6 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
114
click to vote
ICALP
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
123
click to vote
VMCAI
2012
Springer
13 years 10 months ago
2012
Springer
We describe a course on the semantics of a simple imperative programming language and on applications to compilers, type systems, static analyses and Hoare logic. The course is ent...
122
Voted
SLP
1994
15 years 3 months ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
120
click to vote
JELIA
2004
Springer
15 years 7 months ago
2004
Springer
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...