Abstract
We consider the deduction problem in the existential conjunctive fragment of first-order logic with atomic negation. This problem can be recast in terms of other database and artificial intelligence problems, namely query containment, clause entailment and boolean query answering. We refine an algorithm scheme that was proposed for query containment, which itself improves other known algorithms in databases. To study it experimentally, we build a random generator and analyze the influence of several parameters on the problem instance difficulty. Using this methodology, we experimentally compare several heuristics.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases: The Logical Level. Addison-Wesley, Reading (1995)
Chandra, A.K., Merlin, P.M.: Optimal Implementation of Conjunctive Queries in Relational Databases. In: 9th ACM Symposium on Theory of Computing, pp. 77–90 (1977)
Aho, A.V., Sagiv, Y., Ullman, J.D.: Equivalences Among Relational Expressions. SIAM J. Comput. 8(2), 218–246 (1979)
Halevy, A.Y.: Answering Queries Using Views: a Survey. VLDB Journal 10(4), 270–294 (2001)
Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. 2. Computer Science Press, Rockville (1989)
Muggleton, S., De Raedt, L.: Inductive Logic Programming: Theory and Methods. J. Log. Program. 19/20, 629–679 (1994)
Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
Farré, C., Nutt, W., Teniente, E., Urpí, T.: Containment of Conjunctive Queries over Databases with Null Values. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 389–403. Springer, Heidelberg (2007)
Ullman, J.D.: Information Integration Using Logical Views. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 19–40. Springer, Heidelberg (1997)
Wei, F., Lausen, G.: Containment of Conjunctive Queries with Safe Negation. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 343–357. Springer, Heidelberg (2003)
Leclère, M., Mugnier, M.-L.: Some Algorithmic Improvments for the Containment Problem of Conjunctive Queries with Negation. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 401–418. Springer, Heidelberg (2007)
Ben Mohamed, K., Leclère, M., Mugnier, M.-L.: Deduction in existential conjunctive first-order logic: an algorithm and experiments. RR-10010, LIRMM (2010)
Kerdiles, G.: Saying it with Pictures: a Logical Landscape of Conceptual Graphs. Univ. Montpellier II, Amsterdam (2001)
Mugnier, M.-L., Leclère, M.: On Querying Simple Conceptual Graphs with Negation. Data Knowl. Eng. 60(3), 468–493 (2007)
McCune, W.: OTTER 3.3 Reference Manual. CoRR, vol. cs.SC/0310056 (2003)
McCune, W.: Mace4 Reference Manual and Guide. CoRR, vol. cs.SC/0310055 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben Mohamed, K., Leclère, M., Mugnier, ML. (2010). Deduction in Existential Conjunctive First-Order Logic: An Algorithm and Experiments. In: Dicheva, D., Dochev, D. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2010. Lecture Notes in Computer Science(), vol 6304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15431-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-15431-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15430-0
Online ISBN: 978-3-642-15431-7
eBook Packages: Computer ScienceComputer Science (R0)