Author of the publication

Complementing Logic Program Semantics.

, and . ALP, volume 1139 of Lecture Notes in Computer Science, page 238-253. Springer, (1996)

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

Generalizing the Paige-Tarjan Algorithm by Abstract Interpretation, and . CoRR, (2006)An Abstract Interpretation Perspective on Linear vs. Branching Time., and . APLAS, volume 3780 of Lecture Notes in Computer Science, page 69-85. Springer, (2005)On Constructivity of Galois Connections.. VMCAI, volume 10747 of Lecture Notes in Computer Science, page 452-473. Springer, (2018)A Spectrum of Behavioral Relations over LTSs on Probability Distributions., and . CONCUR, volume 6901 of Lecture Notes in Computer Science, page 124-139. Springer, (2011)Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements., and . Inf. Comput., 145 (2): 153-190 (1998)Complementation of Abstract Domains made Easy., and . JICSLP, page 348-362. MIT Press, (1996)Invertible Linear Transforms of Numerical Abstract Domains., and . SAS, volume 11002 of Lecture Notes in Computer Science, page 344-363. Springer, (2018)Genetic adversarial training of decision trees., and . GECCO, page 358-367. ACM, (2021)Abstract Interpretation-Based Feature Importance for Support Vector Machines., , , and . VMCAI (1), volume 14499 of Lecture Notes in Computer Science, page 27-49. Springer, (2024)Robustness Verification of Decision Tree Ensembles., and . OVERLAY@AI*IA, volume 2509 of CEUR Workshop Proceedings, page 59-64. CEUR-WS.org, (2019)