1486 search results - page 146 / 298 » A Logically Saturated Extension of |
145
click to vote
FUIN
2010
15 years 3 months ago
2010
We study the notion of solvability in the resource calculus, an extension of the -calculus modelling resource consumption. Since this calculus is non-deterministic, two different ...
166
Voted
FOSSACS
2007
Springer
16 years 5 days ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
160
click to vote
APLAS
2006
ACM
15 years 12 months ago
2006
ACM
We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our developme...
173
click to vote
JELIA
2004
Springer
15 years 11 months ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
129
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper we present a novel extension to the constraint logic programming on Finite Domains (clp(FD)) which combines the usual clp(FD) primitive constraint X in range with a ...