641 search results - page 47 / 129 » Embedding Finite Sets in a Logic Programming Language |
POPL
2009
ACM
14 years 8 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
ACL
1990
13 years 9 months ago
1990
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
AGP
1995
IEEE
13 years 11 months ago
1995
IEEE
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
UAI
2004
13 years 9 months ago
2004
Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. ...