789 search results - page 35 / 158 » On Theory Revision with Queries |
DLOG
2007
13 years 10 months ago
2007
We present a query answering technique based on notions and results from modal Correspondence Theory. It allows us to answer a wide family of conjunctive queries by polynomial redu...
PLANX
2008
13 years 10 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
EDBT
1990
ACM
14 years 17 days ago
1990
ACM
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
WIKIS
2009
ACM
14 years 3 months ago
2009
ACM
Information Systems (IS) innovations are often characterized by buzzwords, reflecting organizing visions that structure and express the images and ideas formed by a wide community...
LICS
1999
IEEE
14 years 24 days ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...