3047 search results - page 257 / 610 » On the Meaning of Logical Completeness |
222
click to vote
ASP
2003
Springer
16 years 28 days ago
2003
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
211
click to vote
ICLP
2003
Springer
16 years 27 days ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
166
click to vote
PARLE
1992
15 years 11 months ago
1992
We compare di erent degrees of architecture abstraction and communication reliability in distributed programming languages. A nearly architecture independent logic programming lang...
182
click to vote
ITP
2010
15 years 11 months ago
2010
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
206
click to vote
FSTTCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...