507 search results - page 57 / 102 » Automating first-order relational logic |
110
click to vote
LOPSTR
2004
Springer
15 years 6 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
114
Voted
DLOG
2001
15 years 2 months ago
2001
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
61
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
Individual-based models are a relatively new approach to modelling dynamical systems of interacting entities, for example molecules in a biological cell. Although they are computa...
102
Voted
KBSE
2006
IEEE
15 years 6 months ago
2006
IEEE
Traditional design representations are inadequate for generalized reasoning about modularity in design and its technical and economic implications. We have developed an architectu...
125
click to vote
CORR
2008
Springer
15 years 22 days ago
2008
Springer
Proof nets are a graph theoretical representation of proofs in various fragments of type-logical grammar. In spite of this basis in graph theory, there has been relatively little ...