3239 search results - page 173 / 648 » A Logical Process Calculus |
120
click to vote
CADE
2003
Springer
16 years 3 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
106
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
114
click to vote
DALT
2004
Springer
15 years 8 months ago
2004
Springer
This article investigates the intensional programming paradigm for agent communication by introducing context as a first class object in the intensional programming language Lucid...
100
click to vote
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
Knowledge representation systems, including ones based on Description Logics (DLs), use explanation facilities to, among others, debug knowledge bases. Until now, such facilities w...
147
click to vote
ADBIS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...