Sciweavers

175 search results - page 27 / 35
» Generalizing stable semantics by preferences
Sort
View
ICLP
2003
Springer
14 years 21 days ago
Order and Negation as Failure
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
Davy Van Nieuwenborgh, Dirk Vermeir
CSL
1998
Springer
13 years 11 months ago
Revision Programming = Logic Programming + Integrity Constraints
We study revision programming, a logic-based mechanism for enforcing constraints on databases. The central concept of this approach is that of a justi ed revision based on a revisi...
V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczyns...
SIGMOD
2010
ACM
191views Database» more  SIGMOD 2010»
13 years 7 months ago
Data conflict resolution using trust mappings
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
Wolfgang Gatterbauer, Dan Suciu
AICOM
2008
95views more  AICOM 2008»
13 years 7 months ago
A multilayer ontology-based hybrid recommendation model
We propose a novel hybrid recommendation model in which user preferences and item features are described in terms of semantic concepts defined in domain ontologies. The exploitati...
Iván Cantador, Alejandro Bellogín, P...
EUROSYS
2011
ACM
12 years 11 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues