499 search results - page 62 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
115
click to vote
CSL
2009
Springer
15 years 11 months ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
119
click to vote
JLP
1998
15 years 4 months ago
1998
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
145
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
136
click to vote
ICDT
2001
ACM
15 years 8 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
125
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...