Author of the publication

Constructing Refinement Operators by Decomposing Logical Implication.

, , and . AI*IA, volume 728 of Lecture Notes in Computer Science, page 178-189. Springer, (1993)

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

Existence and Nonexistence of Complete Refinement Operators., and . ECML, volume 784 of Lecture Notes in Computer Science, page 307-322. Springer, (1994)Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms., , , and . ILP, volume 1634 of Lecture Notes in Computer Science, page 245-256. Springer, (1999)Complexity Dimensions and Learnability., and . ECML, volume 667 of Lecture Notes in Computer Science, page 348-353. Springer, (1993)Linear Dynamic Kahn Networks Are Deterministic., and . MFCS, volume 1113 of Lecture Notes in Computer Science, page 242-254. Springer, (1996)Least Generalizations and Greatest Specializations of Sets of Clauses, and . CoRR, (1996)A Complete Method for Program Specialization Based on Unfolding., and . ECAI, page 438-442. John Wiley and Sons, Chichester, (1996)Sample PAC-Learnability in Model Inference., and . ECML, volume 784 of Lecture Notes in Computer Science, page 217-230. Springer, (1994)Constructing Refinement Operators by Decomposing Logical Implication., , and . AI*IA, volume 728 of Lecture Notes in Computer Science, page 178-189. Springer, (1993)Kahn's Fixed-Point Characterization for Linear Dynamic Networks., and . SOFSEM, volume 1338 of Lecture Notes in Computer Science, page 513-522. Springer, (1997)Refining Concepts in Description Logics., and . Description Logics, volume 33 of CEUR Workshop Proceedings, page 31-44. CEUR-WS.org, (2000)