2649 search results - page 318 / 530 » Temporal Theories of Reasoning |
CADE
2006
Springer
14 years 1 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
ASP
2003
Springer
14 years 28 days ago
2003
Springer
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures: we show ho...
ECSQARU
1997
Springer
14 years 26 days ago
1997
Springer
We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of origin...
TPHOL
1995
IEEE
14 years 25 days ago
1995
IEEE
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...
LICS
1991
IEEE
14 years 24 days ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...