4617 search results - page 304 / 924 » Automation of Diagrammatic Reasoning |
153
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...
156
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents a compiler from expressive, relational specifications to logic programs. Specifically, the compiler translates the Imperative Alloy specification language to...
181
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We present an integration of answer set programming and constraint processing as an interesting approach to constraint logic programming. Although our research is in a ve...
174
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The linear lambda calculus is very weak in terms of expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension ...
166
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...