1083 search results - page 101 / 217 » Using Contextual Logic Programming for Temporal Reasoning |
129
click to vote
ICLP
2003
Springer
15 years 7 months 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...
147
Voted
ASP
2005
Springer
15 years 8 months ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
164
click to vote
ALP
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
148
Voted
LOPSTR
2005
Springer
15 years 8 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
147
click to vote
ESOP
2010
Springer
15 years 12 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...