Generalizing conjunctive queries for informative answers

Authors:
Katsumi Inoue;Lena Wiese
Affiliations:
National Institute of Informatics, Chiyoda-ku, Tokyo, Japan;National Institute of Informatics, Chiyoda-ku, Tokyo, Japan
Venue:
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
Year:
2011

Citing 11
Cited 2

CoBase: a scalable and extensible cooperative information system

Journal of Intelligent Information Systems - Special issue on intelligent integration of information
FLEX: A Tolerant and Cooperative User Interface to Databases

IEEE Transactions on Knowledge and Data Engineering
Minimal Answer Computation and SOL

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Consequence finding and computing answers with defaults

Journal of Intelligent Information Systems
Negotiation by abduction and relaxation

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Incremental controlled relaxation of failing flexible queries

Journal of Intelligent Information Systems
SOLAR: An automated deduction system for consequence finding

AI Communications - Practical Aspects of Automated Reasoning
Merging first-order knowledge using dilation operators

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Query relaxation in RDF

Journal on data semantics X
Cooperative query answering by abstract interpretation

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
A method based on query caching and predicate substitution for the treatment of failing database queries

ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development

Applications of ordinal ranks to flexible query answering

SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Taxonomy-Based Fragmentation for Anti-instantiation in Distributed Databases

UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deductive generalization of queries is one method to provide informative answers to failing queries. We analyze properties of operators that generalize conjunctive queries consisting of positive as well as negative literals. We show that for the stepwise combination of these operators it suffices to apply the operator in one certain order.