Sciweavers

1055 search results - page 31 / 211
» On the Semantics of Logic Programs with Preferences
Sort
View
AGP
2003
IEEE
14 years 25 days ago
Ordered Programs as Abductive Systems
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
Davy Van Nieuwenborgh, Dirk Vermeir
NMELP
1994
13 years 11 months ago
Static Semantics as Program Transformation and Well-founded Computation
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
Stefania Costantini, Gaetano Aurelio Lanzarone
PRICAI
2000
Springer
13 years 11 months ago
Argumentation Semantics for Defeasible Logics
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the m...
Guido Governatori, Michael J. Maher, Grigoris Anto...
JIDM
2010
160views more  JIDM 2010»
13 years 6 months ago
Evaluation of Conditional Preference Queries
The need for incorporating preference querying in database technology is a very important issue in a variety of applications ranging from e-commerce to personalized search engines....
Fabiola S. F. Pereira, Sandra de Amo
IJCAI
2007
13 years 9 months ago
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination
In the context of the Semantic Web, several approaches to the combination of ontologies, given in terms of theories of classical first-order logic, and rule bases have been propo...
Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans T...