180 search results - page 32 / 36 » Declarative Semantics of Input Consuming Logic Programs |
169
click to vote
CAV
1997
Springer
15 years 9 months ago
1997
Springer
We demonstrate the feasibility of using the XSB tabled logic programming system as a programmable fixed-point engine for implementing efficient local model checkers. In particular,...
165
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
152
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
171
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
178
click to vote
PLANX
2007
15 years 7 months ago
2007
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...