Sciweavers

972 search results - page 13 / 195
» Using Preference Order in Ontologies
Sort
View
PADL
2005
Springer
14 years 1 months ago
An Ordered Logic Program Solver
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
CAISE
2004
Springer
14 years 1 months ago
Enriching Ontology Languages Adequacy for eBusiness Domain
Abstract. The definition of a domain ontology is a complex activity that requires two kinds of expertise: a deep knowledge of the domain to be modeled and a good level of familiari...
Michele Missikoff, Federica Schiappelli
AAAI
2007
13 years 10 months ago
Interest-Matching Comparisons using CP-nets
The formation of internet-based social networks has revived research on traditional social network models as well as interest-matching, or match-making, systems. In order to autom...
Andrew W. Wicker, Jon Doyle
FLAIRS
2008
13 years 10 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
ASP
2003
Springer
14 years 28 days ago
CR-Prolog with Ordered Disjunction
We present CR-Prolog2, an extension of A-Prolog with cr-rules and ordered disjunction. CR-rules can be used to formalize various types of common-sense knowledge and reasoning, tha...
Marcello Balduccini, Veena S. Mellarkod