ICLP
2004
Springer
14 years 5 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
ICLP
2004
Springer
14 years 5 months ago
2004
Springer
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
ICLP
2004
Springer
14 years 5 months ago
2004
Springer
ICLP
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
ICLP
2004
Springer
14 years 5 months ago
2004
Springer
A component is the basic re-usable unit of composition to build composite systems by connecting to others through their provided and required ports. Checking the functional complia...
ESOP
2004
Springer
14 years 5 months ago
2004
Springer
A transaction defines a locus of computation that satisfies important concurrency and failure properties; these so-called ACID properties provide strong serialization guarantees ...
ESOP
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. This paper studies continuations by means of a polymorphic type system. The traditional call-by-name continuation passing style transform admits a typing in which some an...
ESOP
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
ESOP
2004
Springer
14 years 5 months ago
2004
Springer
ESOP
2004
Springer
14 years 5 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...