Sciweavers

3134 search results - page 43 / 627
» Computing full disjunctions
Sort
View
WWW
2008
ACM
14 years 10 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
FOIKS
2008
Springer
13 years 11 months ago
A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases
Abstract In this paper we present a new rule-based approach for consistency preserving view updating in deductive databases. Based on rule transformations performed during schema d...
Andreas Behrend, Rainer Manthey
AIIA
2007
Springer
14 years 4 months ago
A Top Down Interpreter for LPAD and CP-Logic
Logic Programs with Annotated Disjunctions and CP-logic are two different but related languages for expressing probabilistic information in logic programming. The paper presents a...
Fabrizio Riguzzi
ICLP
2007
Springer
14 years 4 months ago
Generic Tableaux for Answer Set Programming
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
Martin Gebser, Torsten Schaub
SUM
2009
Springer
14 years 2 months ago
Weighted Description Logics Preference Formulas for Multiattribute Negotiation
We propose a framework to compute the utility of an agreement w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formula...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...