1020 search results - page 47 / 204 » Tight Semantics for Logic Programs |
PPDP
2007
Springer
15 years 6 months ago
2007
Springer
We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references....
103
click to vote
LPNMR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
116
click to vote
ENTCS
2002
14 years 11 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
136
click to vote
CL
2012
Springer
13 years 2 months ago
2012
Springer
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
TACS
2001
Springer
15 years 4 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...