Author of the publication

Efficient Unificatioin with Infinite Terms in Logic Programming.

, and . FGCS, page 202-209. OHMSHA Ltd. Tokyo and North-Holland, (1984)

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

Helping Programmers to Adopt Set-Based Specifications., , and . FMSEE&T@FM, volume 1385 of CEUR Workshop Proceedings, page 3-10. CEUR-WS.org, (2015)Solving Systems of Equations over Hypersets., , , and . GULP-PRODE (1), page 403-417. (1994)Using Prolog for Building Frog, a Hybrid Knowledge Representation System., and . New Generation Comput., 6 (4): 361-388 (1989)Extensional and Intensional Sets in CLP with Intensional Negation., , , , and . ICLP Workshop on Logic Programming with Sets, (1993)Unification of Hyperset Terms., , , and . ICLP Workshop on Logic Programming with Sets, (1993)Compiling Intensional Sets in CLP., , , and . ICLP, page 647-661. MIT Press, (1994)log: A Logic Programming Language with Finite Sets., , , and . ICLP, page 111-124. MIT Press, (1991)Integrating Cardinality Constraints into Constraint Logic Programming with Sets., and . Theory Pract. Log. Program., 23 (2): 468-502 (March 2023)A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form., , and . AI*IA, volume 10037 of Lecture Notes in Computer Science, page 179-191. Springer, (2016)A Practical Decision Procedure for Quantifier-Free, Decidable Languages Extended with Restricted Quantifiers., and . J. Autom. Reason., 68 (4): 23 (December 2024)