Complexity and Expressive Power of Logic Programming (1997)

by Evgeny Dantsin , Thomas Eiter , Georg Gottlob , Andrei Voronkov
Citations:298 - 56 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
2359 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
860 Classical Negation in Logic Programs and Disjunctive Databases – Michael Gelfond, Vladimir Lifschitz - 1991
1549 Foundations of Databases – S ABITEBOUL, R HULL, V VIANU - 1995
849 The Well-Founded Semantics for General Logic Programs – Kenneth A. Ross - 1991
778 Logical foundations of object-oriented and frame-based languages – Michael Kifer, Georg Lausen, James Wu - 1995
1504 The Stable Model Semantics For Logic Programming – Michael Gelfond, Vladimir Lifschitz - 1988
460 Optimal implementation of conjunctive queries in relational databases – A Chandra, P M Merlin - 1977
615 Towards a theory of declarative knowledge – K Apt, H A Blair, A Walker - 1987