Sciweavers

77 search results - page 5 / 16
» Description Logic Programs: Normal Forms
Sort
View
ASP
2003
Springer
14 years 21 days ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
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 ...
Robert E. Mercer, Vincent Risch
LPNMR
2004
Springer
14 years 25 days ago
Logic Programs With Monotone Cardinality Atoms
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
V. Wiktor Marek, Ilkka Niemelä, Miroslaw Trus...
JACM
2010
137views more  JACM 2010»
13 years 6 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
JAPLL
2010
141views more  JAPLL 2010»
13 years 6 months ago
Algebraic tableau reasoning for the description logic SHOQ
Semantic web applications based on the web ontology language (OWL) often require the use of numbers in class descriptions for expressing cardinality restrictions on properties or ...
Jocelyne Faddoul, Volker Haarslev
IAT
2009
IEEE
13 years 11 months ago
Combining Boolean Games with the Power of Ontologies for Automated Multi-attribute Negotiation in the Semantic Web
Recently, multi-attribute negotiation has been extensively studied from a game-theoretic viewpoint. Since normal and extensive form games have the drawback of requiring an explicit...
Thomas Lukasiewicz, Azzurra Ragone