507 search results - page 34 / 102 » Automating first-order relational logic |
90
Voted
JAIR
2011
14 years 7 months ago
2011
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
119
Voted
TIME
2007
IEEE
15 years 7 months ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
101
Voted
CADE
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we pre...
104
Voted
ASP
2003
Springer
15 years 6 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
132
click to vote
ECSQARU
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We consider a realization of Reiter-style default logic on top of description logic knowledge bases (DL-KBs). To this end, we present elegant transformations from default...