( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Logic Program Termination Analysis Using Atom Sizes.

, , , и . IJCAI, стр. 2833-2839. AAAI Press, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Monika Marcotty

Johannes Marcour

Hans-Ernst Marcolin

Carlos Javier Marcos Navas

Massimiliano Marcon

 

Другие публикации лиц с тем же именем

Querying Data Exchange Settings Beyond Positive Queries., , , и . Datalog, том 3203 из CEUR Workshop Proceedings, стр. 27-41. CEUR-WS.org, (2022)Checking Termination of Datalog with Function Symbols Through Linear Constraints., , , и . SEBD, стр. 192-199. Curran Associates, Inc., (2015)Counting Database Repairs Entailing a Query: The Case of Functional Dependencies., , , и . PODS, стр. 403-412. ACM, (2022)Leveraging Equality Generating Dependencies for Chase Termination., , , и . SEBD, стр. 94-101. Matematicamente.it, (2016)Non-Uniformly Terminating Chase: Size and Complexity., , и . PODS, стр. 369-378. ACM, (2022)Probabilistic Answers over Inconsistent Knowledge Bases., , , , и . SEBD, том 2646 из CEUR Workshop Proceedings, стр. 48-55. CEUR-WS.org, (2020)Enhancing Ontological Query-Rewriting via Parallelization., и . SEBD, том 3478 из CEUR Workshop Proceedings, стр. 401-409. CEUR-WS.org, (2023)Explainable Acceptance in Probabilistic Abstract Argumentation: Complexity and Approximation., , , , и . KR, стр. 33-43. (2020)Consistent query answering with prioritized active integrity constraints., , , , , и . IDEAS, стр. 3:1-3:10. ACM, (2020)The Complexity of Why-Provenance for Datalog Queries., , , и . Proc. ACM Manag. Data, 2 (2): 83 (2024)