Sciweavers

3775 search results - page 249 / 755
» The Expression Problem Revisited
Sort
View
156
Voted
AAAI
2007
15 years 8 months ago
Approximate Query Answering in Locally Closed Databases
The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomp...
Alvaro Cortés-Calabuig, Marc Denecker, Ofer...
167
Voted
ACL
2008
15 years 7 months ago
An Entity-Mention Model for Coreference Resolution with Inductive Logic Programming
The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing. To deal with this problem, we present ...
Xiaofeng Yang, Jian Su, Jun Lang, Chew Lim Tan, Ti...
SBBD
2007
179views Database» more  SBBD 2007»
15 years 7 months ago
Assisting XML Schema Evolution that Preserves Validity
Abstract. We consider the problem of XML schema evolution preserving the validity of existing documents related to the original schema. The aim of such schema evolution is to fit ...
Béatrice Bouchou, Denio Duarte
FCS
2006
15 years 7 months ago
The Representational Power of Conjunctive Normal Form
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
Thomas O'Neil, Jason Smith
146
Voted
IJCAI
2001
15 years 7 months ago
Computational Complexity of Planning with Temporal Goals
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
Chitta Baral, Vladik Kreinovich, Raul Trejo