Sciweavers

226 search results - page 24 / 46
» Reasoning about the Semantic Web using Answer Set Programmin...
Sort
View
LPNMR
2007
Springer
15 years 3 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
ASP
2005
Springer
15 years 3 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
LPKR
1997
Springer
15 years 1 months ago
Reasoning with Prioritized Defaults
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a do...
Michael Gelfond, Tran Cao Son
DKE
2008
114views more  DKE 2008»
14 years 9 months ago
Proof explanation for a nonmonotonic Semantic Web rules language
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 ...
Grigoris Antoniou, Antonis Bikakis, Nikos Dimaresi...
ICLP
2004
Springer
15 years 2 months ago
Possible Worlds Semantics for Probabilistic Logic Programs
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
Alex Dekhtyar, Michael I. Dekhtyar