60 search results - page 3 / 12 » Quantitative Logic Programming Revisited |
CTCS
1989
Springer
13 years 11 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
POPL
2010
ACM
14 years 4 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...
LPNMR
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Belief Logic Programming (BLP) is a novel form of quantitative logic programming in the presence of uncertain and inconsistent information, which was designed to be able ...
WOLLIC
2010
Springer
14 years 12 days ago
2010
Springer
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...
ECP
1997
Springer
13 years 11 months ago
1997
Springer
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...