260 search results - page 35 / 52 » Merging Belief Bases Represented by Logic Programs |
117
click to vote
FOIKS
2006
Springer
15 years 3 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
116
click to vote
DKE
2008
14 years 11 months ago
2008
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...
132
click to vote
KR
1991
Springer
15 years 3 months ago
1991
Springer
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
103
click to vote
CADE
2008
Springer
16 years 12 hour ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
107
click to vote
AMAI
2006
Springer
14 years 11 months ago
2006
Springer
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...