M. Alviano, N. Leone, M. Manna, G. Terracina, and P. Veltri. 2012. Magic-sets for Datalog with existential quantifiers. In Proc. of the Second International Workshop on Datalog in Academia and Industry: Datalog 2.0, pp. 31–43. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-642-32925-8_5. 28
J. Anderson, M. Gaare, J. Holguín, N. Bailey, and T. Pratley. 2016. The Datomic database. In Professional Clojure, pp. 169–215. Wiley Online Library. 88
R. Angles and C. Gutierrez. 2008. The expressive power of SPARQL. In Proc. of the 7th International Conference on The Semantic Web, ISWC ’08, pp. 114–129. Springer-Verlag, Berlin, Heidelberg. DOI: 10.1007/978-3-540-88564-1_8. 76
K. R. Apt, H. A. Blair, and A. Walker. 1988. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. DOI: 10.1016/B978-0-934613-40-8.50006-3. 19
M. Aref, B. ten Cate, T. J. Green, B. Kimelfeld, D. Olteanu, E. Pasalic, T. L. Veldhuizen, and G. Washburn. 2015. Design and implementation of the LogicBlox system. In Proc. of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD ’15, pp. 1371–1382. ACM. DOI: 10.1145/2723372.2742796. 28, 29, 87
F. Arni, K. Ong, S. Tsur, H. Wang, and C. Zaniolo. Jan. 2003. The deductive database system LDL++. Theory and Practice of Logic Programming, 3(1):61–94. DOI: 10.1017/S1471068402001515. 67
M. P. Ashley-Rollman, S. C. Goldstein, P. Lee, T. C. Mowry, and P. Pillai. Oct. 2007. Meld: A declarative approach to programming ensembles. In 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2794–2800. DOI: 10.1109/IROS.2007.4399480. 83
F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. 2003. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, New York. 64, 78
F. Bancilhon. Sept. 1978. On the completeness of query languages for relational data bases. In Proc. of the 7th Symposium on Mathematical Foundations of Computer Science, pp. 112–123. DOI: 10.1007/3-540-08921-7_60. 13
F. Bancilhon and S. N. Khoshafian. Apr. 1989. A calculus for complex objects. Journal of Computer and System Sciences, 38(2):326–340. DOI: 10.1016/0022-0000(89)90005-6. 34
F. Bancilhon and R. Ramakrishnan. 1986. An amateur’s introduction to recursive query processing strategies. In Proc. of the 1986 ACM SIGMOD International Conference on Management of Data, SIGMOD ’86, pp. 16–52. ACM. DOI: 10.1145/16894.16859. 48, 60, 61
F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. 1986. Magic sets and other strange ways to implement logic programs. In ACM Symposium on Principles of Database Systems, pp. 1–15. DOI: 10.1145/6012.15399. 16, 50, 51, 93
R. Basseda and M. Kifer. June 2015a. State space planning using Transaction Logic. In International Symposium on Practical Aspects of Declarative Languages (PADL 2015), pp. 17–33. DOI: 10.1007/978-3-319-19686-2_2. 46
R. Basseda and M. Kifer. Aug. 2015b. Planning with regression analysis in Transaction Logic. In Web Reasoning and Rule Systems, 9th International Conference (RR 2015), pp. 45–60. DOI: 10.1007/978-3-319-22002-4_5. 46
R. Basseda, M. Kifer, and A. J. Bonner. Sept. 2014. Planning with Transaction Logic. In 8th International Conference on Web Reasoning and Rule Systems, (RR 2014), vol. 8741 of Lecture Notes in Computer Science, pp. 29–44. Springer. DOI: 10.1007/978-3-319-11113-1_3. 46
M. Y. Becker and P. Sewell. 2004. Cassandra: Distributed access control policies with tunable expressiveness. In Proc. of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks, POLICY ’04, pp. 159–168. IEEE Computer Society. DOI: 10.1109/POLICY.2004.1309162. 82
C. Beeri. 1989. Formal models for object-oriented databases. In International Conference on Deductive and Object-Oriented Databases, pp. 370–395. Elsevier Science Publishers. DOI: 10.1016/B978-0-444-88433-6.50030-7. 34
C. Beeri and R. Ramakrishnan. 1991. On the power of magic. Journal of Logic Programming, 10(3&4):255–299. DOI: 10.1016/0743-1066(91)90038-Q. 51
C. Beeri and M. Y. Vardi. 1981. The implication problem for data dependencies. In S. Even and O. Kariv, editors, Automata, Languages and Programming: Eighth Colloquium, pp. 73–85. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-10843-2_7. 26
C. Beeri, R. Nasr, and S. Tsur. 1988. Embedding ψ-terms in a horn-clause logic language. In Third International Conference on Data and Knowledge Bases: Improving Usability and Responsiveness, pp. 347–359. Morgan Kaufmann. DOI: 10.1016/B978-1-4832-1313-2.50033-0. 33
C. Beeri, S. Naqvi, O. Shmueli, and S. Tsur. Apr. 1991. Set constructors in a logic database language. Journal of Logic Programming, 10: 181–232. DOI: 10.1016/0743-1066(91)90036-O. 33
T. Berners-Lee, J. Handler, and O. Lassila. May 2001. The Semantic Web. Scientific American. 78
D. G. Bobrow. Apr. 1980. Artificial Intelligence: Special Issue on Non-Monotonic Logic, vol. 13 no. 1-2. Elsevier. 21
H. Boley and M. Kifer, July 2013a. RIF Basic logic dialect. W3C Recommendation. Available at: http://www.w3.org/TR/rif-bld/. 78
H. Boley and M. Kifer, July 2013b. RIF Framework for logic dialects. W3C Recommendation. Available at: http://www.w3.org/TR/rif-fld/. 78
A. J. Bonner and M. Kifer. June 1993. Transaction Logic programming. In International Conference on Logic Programming, pp. 257–282. MIT Press. 43, 45
A. J. Bonner and M. Kifer. Oct. 1994. An overview of Transaction Logic. Theoretical Computer Science, 133: 205–265. DOI: 10.1016/0304-3975(94)90190-2. 43, 45
A. J. Bonner and M. Kifer. Nov. 1995. Transaction Logic programming (or a logic of declarative and procedural knowledge). Technical Report CSRI-323, University of Toronto. Available at: http://www.cs.toronto.edu/~bonner/transaction-logic.html. 45
A. J. Bonner and M. Kifer. Sept. 1996. Concurrency and communication in Transaction Logic. In Joint International Conference and Symposium on Logic Programming, pp. 142–156. MIT Press. 45
A. J. Bonner and M. Kifer. 1998a. The state of change: A survey. In Freitag et al. [1998]. Springer. 39
A. J. Bonner and M. Kifer. 1998b. Results on reasoning about action in Transaction Logic. In Freitag et al. [1998]. Springer-Verlag. 46
A. J. Bonner, M. Kifer, and M. Consens. Aug./Sept. 1993. Database programming in Transaction Logic. In Proc. of the Fourth International Workshop on Database Programming Languages, pp. 309–337. DOI: 10.1007/978-1-4471-3564-7_18. 45
G. Brewka, J. Dix, and K. Konolige. 1997. Nonmonotonic Reasoning: An Overview, vol. 73 of CSLI Lecture Notes. CSLI Publications, Stanford, CA. 21
F. Bry. Oct. 1990. Query evaluation in recursive databases: Bottom-up and top-down reconciled. Data Knowledge Engineering, 5(4):289–312. DOI: 10.1016/B978-0-444-88433-6.50010-1. 61
M. Calautti, G. Gottlob, and A. Pieris. 2015. Chase termination for guarded existential rules. In Proc. of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, pp. 91–103. DOI: 10.1145/2745754.2745773. 27
A. Calì, G. Gottlob, and A. Pieris. 2011. New expressive languages for ontological query answering. In Proc. of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, pp. 1541–1546. 25, 28
A. Calì, G. Gottlob, and M. Kifer. 2013. Taming the infinite chase: Query answering under expressive relational constraints. Journal of Artificial Intelligence Research, 48: 115–174. 26, 28
M. J. Carey, D. J. DeWitt, J. E. Richardson, and E. J. Shekita. 1986. Object and file management in the EXODUS extensible database