Sciweavers

352 search results - page 22 / 71
» Preferences, Contexts and Answer Sets
Sort
View
ACL
1997
14 years 11 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
ECSQARU
2007
Springer
15 years 4 months ago
Syntactic Propositional Belief Bases Fusion with Removed Sets
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
Julien Hué, Odile Papini, Eric Würbel
ICLP
1994
Springer
15 years 2 months ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner
IQIS
2004
ACM
15 years 3 months ago
Utility-based Resolution of Data Inconsistencies
A virtual database system is software that provides unified access to multiple information sources. If the sources are overlapping in their contents and independently maintained,...
Amihai Motro, Philipp Anokhin, Aybar C. Acar
VLDB
2001
ACM
157views Database» more  VLDB 2001»
15 years 10 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy