305 search results - page 22 / 61 » A Connectionist Framework for Reasoning: Reasoning with Exam... |
LPAR
2004
Springer
14 years 28 days ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
CSCW
1994
ACM
13 years 11 months ago
1994
ACM
The need to merge different versions of an object toa common state arises in collaborative computing due to several reasons including optimistic concurrency control, asynchronous ...
IJMSO
2006
13 years 7 months ago
2006
Recent expectations regarding the new generation of Web strongly depend on the success of Semantic Web technology. Resource Description Framework (RDF) is a basis for an explicit a...
ENTCS
2007
13 years 7 months ago
2007
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
Model checking is emerging as a popular technology for reasoning about behavioral properties of a wide variety of software artifacts including: requirements models, architectural ...