Registro:

Referencias:

• Abriola, S., Barceló, P., Figueira, D., Figueira, S., Bisimulations on data graphs (2016) Principles of Knowledge Representation and Reasoning: Proceedings of The Fifteenth International Conference, pp. 309-318. , KR
• Abriola, S., Descotte, M.E., Figueira, S., Definability for downward and vertical XPath on data trees (2014) 21th Workshop on Logic, Language, Information and Computation, Vol. 6642 of Lecture Notes in Computer Science, pp. 20-34
• Abriola, S., Descotte, M.E., Figueira, S., Model theory of XPath on data trees. Part II: Binary bisimulation and definability (2017) Information and Computation, , To appear
• Abriola, S., Figueira, D., Figueira, S., Logics of repeating values on data trees and branching counter systems (2017) International Conference on Foundations of Software Science and Computational Structures, Lecture Notes in Computer Science, , Springer
• Angles, R., Gutiérrez, C., Survey of graph database models (2008) ACM Comput. Surv., 40 (1)
• Areces, C., Koller, A., Striegnitz, K., Referring expressions as formulas of description logic (2008) Proc. of The 5th INLG, , Salt Fork, OH, USA
• Areces, C., Figueira, S., Gorín, D., Using logic in the generation of referring expressions (2011) Logical Aspects of Computational Linguistics, pp. 17-32. , Springer
• Balcázar, J., Gabarro, J., Santha, M., Deciding bisimilarity is P-complete (1992) Formal Aspects of Computing, 4 (1), pp. 638-648
• Barceló, P., Querying graph databases (2013) PODS, pp. 175-188
• Belardinelli, F., Lomuscio, A., Patrizi, F., Verification of agent-based artifact systems (2014) J. Artif. Intell. Res. (JAIR), 51, pp. 333-376
• Blackburn, P., De Rijke, M., Venema, Y., (2001) Modal Logic, , Cambridge University Press
• Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., Two-variable logic on data trees and XML reasoning (2009) J. ACM, 56 (3)
• Calvanese, D., De Giacomo, G., Lenzerini, M., Vardi, M.Y., Containment of conjunctive regular path queries with inverse (2000) KR, pp. 176-185
• Clarke, E.M., Grumberg, O., Peled, D., (2001) Model Checking, , MIT Press
• Dalmau, V., Kolaitis, P.G., Vardi, M.Y., Constraint satisfaction, bounded treewidth, and finite-variable logics (2002) CP, pp. 310-326
• David, C., Gheerbrant, A., Libkin, L., Martens, W., Containment of pattern-based queries over data trees (2013) ICDT, pp. 201-212. , ACM
• Dawar, A., Otto, M., Modal characterisation theorems over special classes of frames (2009) Annals of Pure and Applied Logic, 161 (1), pp. 1-42
• Dechter, R., From local to global consistency (1992) Artif. Intell., 55 (1), pp. 87-108
• Dechter, R., (1992) Constraint processing, 55 (1), pp. 87-108. , Elsevier Morgan Kaufmann
• Demri, S., D’Souza, D., Gascon, R., Decidable temporal logic with repeating values (2007) Symposium on Logical Foundations of Computer Science, pp. 180-194. , Vol. 4514 of LNCS, Springer
• Demri, S., Figueira, D., Praveen, M., Reasoning about data repetitions with counter systems (2016) Log. Methods Comput. Sci., 12 (3)
• Demri, S., Lazić, R., LTL with the freeze quantifier and register automata (2009) ACM Trans. Comput. Log., 10 (3)
• Demri, S., Lazić, R., Nowak, D., On the freeze quantifier in constraint LTL: Decidability and complexity (2005) International Symposium on Temporal Representation and Reasoning, pp. 113-121. , IEEE Press
• Fan, W., Li, J., Wang, X., Wu, Y., Query preserving graph compression (2012) SIGMOD, pp. 157-168
• Figueira, D., (2010) Reasoning on Words and Trees with Data, , PhD thesis, Laboratoire Spécification et Vérification, ENS Cachan, France
• Figueira, D., Decidability of downward XPath (2012) ACM Trans. Comput. Log, 13 (4), pp. 249-260
• Figueira, D., On XPath with transitive axes and data tests (2012) PODS, pp. 249-260. , ACM
• Figueira, D., Figueira, S., Areces, C., Basic model theory of xpath on data trees (2014) ICDT, pp. 50-60
• Figueira, D., Figueira, S., Areces, C., Model theory of XPath on data trees. Part i: Bisimulation and characterization (2015) Journal of Artificial Intelligence Research, 53, pp. 271-314
• Figueira, S., Gorín, D., On the size of shortest modal descriptions (2010) Advances in Modal Logic, 8, pp. 114-132
• Fischer, M.J., Ladner, R.E., Propositional dynamic logic of regular programs (1979) J. Comput. Syst. Sci., 18 (2), pp. 194-211
• Getoor, L., Diehl, C.P., Link mining: A survey (2005) ACM SIGKDD Explorations Newsletter, 7 (2), pp. 3-12
• Givan, R., Dean, T.L., Greig, M., Equivalence notions and model minimization in markov decision processes (2003) Artif. Intell., 147 (1-2), pp. 163-223
• Hariri, B.B., Calvanese, D., De Giacomo, G., Deutsch, A., Montali, M., Verification of relational data-centric dynamic systems with external services (2013) PODS, pp. 163-174
• Hariri, B.B., Calvanese, D., Montali, M., De Giacomo, G., De Masellis, R., Felli, P., Description logic knowledge and action bases (2013) J. Artif. Intell. Res. (JAIR), 46, pp. 651-686
• Jurdzinski, M., Lazić, R., Alternation-free modal mu-calculus for data trees (2007) LICS, pp. 131-140. , IEEE Press
• Jurdzinski, M., Lazić, R., Alternating automata on data trees and xpath satisfiability (2011) ACM Trans. Comput. Log., 12 (3), p. 19
• Kara, A., Schwentick, T., Zeume, T., Temporal logics on words with multiple data values (2010) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
• Kolaitis, P.G., Vardi, M.Y., A game-theoretic approach to constraint satisfaction (2000) AAAI, pp. 175-181
• Kozen, D., Lower bounds for natural proof systems (1977) FOCS, pp. 254-266
• Krahmer, E., Van Erk, S., Verleg, A., Graph-based generation of referring expressions (2003) Computational Linguistics, 29 (1)
• Krahmer, E., Van Deemter, K., Computational generation of referring expressions: A survey (2012) Computational Linguistics, 38 (1), pp. 173-218
• Kupferman, O., Vardi, M.Y., Verification of fair transition systems (1998) Chicago J. Theor. Comput. Sci., , 1998
• Kurtonina, N., De Rijke, M., Expressiveness of concept expressions in first-order description logics (1999) Artif. Intell., 107 (2), pp. 303-333
• Libkin, L., Martens, W., Vrgoč, D., Querying graph databases with XPath (2013) ICDT, pp. 129-140. , ACM
• Libkin, L., Martens, W., Vrgoc, D., Querying graphs with data (2016) J. ACM, 63 (2), p. 14
• Libkin, L., Vrgoč, D., Regular path queries on graphs with data (2012) ICDT, pp. 74-85
• Luo, Y., Fletcher, G.H.L., Hidders, J., Bra, P.D., Wu, Y., Regularities and dynamics in bisimulation reductions of big graphs (2013) GRADES 2013, p. 13
• Luo, Y., Fletcher, G.H.L., Hidders, J., Wu, Y., Bra, P.D., External memory k-bisimulation reduction of big graphs (2013) 22nd ACM CIKM’13, pp. 919-928
• Lutz, C., Description logics with concrete domains—a survey (2003) Advances in Modal Logics, 4. , King’s College Publications
• Lutz, C., Areces, C., Horrocks, I., Sattler, U., Keys, nominals, and concrete domains (2005) J. Artif. Intell. Res. (JAIR), 23, pp. 667-726
• Meyer, A.R., Stockmeyer, L.J., The equivalence problem for regular expressions with squaring requires exponential space (1972) SWAT (FOCS), pp. 125-129
• Milner, R., An algebraic definition of simulation between programs (1971) Proceedings of The 2nd International Joint Conference on Artificial Intelligence, pp. 481-489
• Milner, R., (1999) Communicating and Mobile Systems - The Pi-Calculus, , Cambridge University Press
• Milo, T., Suciu, D., Index structures for path expressions (1999) ICDT, pp. 277-295
• Murawski, A.S., Ramsay, S.J., Tzevelekos, N., Bisimilarity in fresh-register automata (2015) LICS, pp. 156-167. , IEEE Press
• Park, D.M.R., Concurrency and automata on infinite sequences (1981) Theoretical Computer Science, 5th GI-Conference, pp. 167-183. , Karlsruhe, Germany, March 23-25, 1981, Proceedings
• Robinson, I., Webber, J., Eifrem, E., (2013) Graph Databases, , O’Reilly Media, Inc
• Sangiorgi, D., On the origins of bisimulation and coinduction (2009) ACM Trans. Program. Lang. Syst., 31 (4), pp. 1-41
• Savitch, W.J., Relationships between nondeterministic and deterministic tape complexities (1970) J. Comput. Syst. Sci., 4 (2), pp. 177-192
• Van Benthem, J., (1976) Modal Correspondence Theory, , PhD thesis, Universiteit van Amsterdam

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------