Sciweavers

2253 search results - page 357 / 451
» The ComFoRT Reasoning Framework
Sort
View
BIRTHDAY
2003
Springer
14 years 2 months ago
A Hierarchical Completeness Proof for Propositional Temporal Logic
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...
Ben C. Moszkowski
CAISE
2003
Springer
14 years 2 months ago
Extending UML to Represent XML Schemas
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...
Belén Vela, Esperanza Marcos
ICLP
2003
Springer
14 years 2 months ago
Termination Analysis with Types Is More Accurate
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...
Vitaly Lagoon, Frédéric Mesnard, Pet...
ICLP
2003
Springer
14 years 2 months ago
On Deterministic Computations in the Extended Andorra Model
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...
Ricardo Lopes, Vítor Santos Costa, Fernando...
ICLP
2003
Springer
14 years 2 months ago
Concurrency, Time, and Constraints
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...
Frank D. Valencia