Author of the publication

On the Complexity of Some Inductive Logic Programming Problems.

, , and . New Generation Comput., 17 (1): 53-75 (1999)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Joining Fragmented Relations in Distributed Databases., , and . XP4.5 Workshop on Database Theory, (1983)Translation and Optimization of Logic Queries: The Algebraic Approach., , and . VLDB, page 395-402. Morgan Kaufmann, (1986)Visual Data Extraction Through Visual Logic Programming.. NMR, page 4. (2002)Disjunctive Logic Programming over Finite Structures., , and . GI Jahrestagung, page 69-73. Springer, (1994)Recent Complexity Results in Logic Programming and Nonmonotonic Reasoning, and Why They Matter (Invited Talk Abstract).. LPNMR, page 265. MIT Press, (1993)Distributed XML Design, , and . CoRR, (2010)Complexity Results for Logic-Based Abduction., and . Structural Complexity and Recursion-theoretic methods in Logic-Programming, page 29-44. Mathematical Sciences Institute, Cornell University, (1992)Datalog: Bag Semantics via Set Semantics., , and . CoRR, (2018)HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings., , , and . CoRR, (2018)Multiagent Compromises, Joint Fixpoints, and Stable Models., and . Computational Logic: Logic Programming and Beyond, volume 2407 of Lecture Notes in Computer Science, page 561-585. Springer, (2002)