Sciweavers

606 search results - page 60 / 122
» Constraint Hierarchies and Logic Programming
Sort
View
DLOG
2008
13 years 11 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 8 months ago
On Role Logic
We present role logic, a notation for describing properties of relational structures in shape analysis, databases, and knowledge bases. We construct role logic using the ideas of ...
Viktor Kuncak, Martin C. Rinard
KRDB
2003
111views Database» more  KRDB 2003»
13 years 10 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 4 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...
ICLP
2005
Springer
14 years 2 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli