3776 search results - page 414 / 756 » Partition-Based Logical Reasoning |
129
click to vote
BIRTHDAY
2003
Springer
15 years 10 months ago
2003
Springer
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...
125
Voted
KI
1999
Springer
15 years 9 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, it can, for instance, be u...
160
click to vote
AAAI
2008
15 years 7 months ago
2008
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base whi...
153
click to vote
ARGMAS
2005
Springer
15 years 6 months ago
2005
Springer
of Abstract Argumentation Guido Boella1 , Joris Hulstijn2 , and Leendert van der Torre3 1 Universit´a di Torino 2 Vrije Universiteit, Amsterdam 3 CWI Amsterdam and Delft Universit...
156
click to vote
CLIMA
2007
15 years 6 months ago
2007
We present a sound and complete tableau calculus for a class BReg of extended regular modal logics which contains useful epistemic logics for reasoning about agent beliefs. Our cal...