2253 search results - page 357 / 451 » The ComFoRT Reasoning Framework |
149
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
150
click to vote
CAISE
2003
Springer
15 years 11 months ago
2003
Springer
The consolidation of the Web as one of the most important ways to share and spread information has given raise to a huge amount of information systems for this media. This is the r...
173
click to vote
ICLP
2003
Springer
15 years 11 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...
150
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
176
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...