From post

Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra Can Help in Equational Unification.

, и . RTA, том 488 из Lecture Notes in Computer Science, стр. 124-135. Springer, (1991)

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.

 

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

Completing Desscription Logic Knowledge Bases using Formal Concept Analysis, , , и . OWLED 2007, (2008)Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles. RR-90-13. Deutsches Forschungszentrum für Künstliche Intelligenz GmbH\\Erwin-Schrödinger Strasse\\Postfach 2080\\67608 Kaiserslautern\\Germany, (1990)Unification Properties of Commutative Theories: A Categorical Treatment.. Category Theory and Computer Science, том 389 из Lecture Notes in Computer Science, стр. 273-299. Springer, (1989)Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures., и . CADE, том 607 из Lecture Notes in Computer Science, стр. 50-65. Springer, (1992)Extensions to Description Logics., , и . Description Logic Handbook, Cambridge University Press, (2003)Efficient TBox Reasoning with Value Restrictions using the ℱℒ0wer reasoner., , , , и . CoRR, (2021)07401 Executive Summary -- Deduction and Decision Procedures., , , и . Deduction and Decision Procedures, том 07401 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)The Data Complexity of Answering Instance Queries in FL0., , и . WWW (Companion Volume), стр. 1603-1607. ACM, (2018)Finding Small Proofs for Description Logic Entailments: Theory and Practice (Extended Technical Report)., , , , и . CoRR, (2020)On the Combination of Symbolic Constraints, Solution Domains, and Constraint Solvers., и . CP, том 976 из Lecture Notes in Computer Science, стр. 380-397. Springer, (1995)