Sciweavers

448 search results - page 80 / 90
» Answer Set Programming: A Primer
Sort
View
AAAI
2007
14 years 12 months ago
Generality and Equivalence Relations in Default Logic
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
Katsumi Inoue, Chiaki Sakama
LANMR
2007
14 years 11 months ago
Handling Exceptions in nonmonotonic reasoning
Abstract We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, chang...
Marcelino C. Pequeno, Rodrigo de M. S. Veras, Wlad...
89
Voted
VLDB
2002
ACM
151views Database» more  VLDB 2002»
14 years 9 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
SEMWEB
2010
Springer
14 years 7 months ago
Declarative Semantics for the Rule Interchange Format Production Rule Dialect
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
Carlos Viegas Damásio, José Jú...
98
Voted
JAIR
2011
123views more  JAIR 2011»
14 years 4 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...