Comparative Similarity, Tree Automata, and Diophantine Equations

DOI10.1007/11591191_45MaRDI QIDQ5387872zbMATH OpenOpenAlexFDO

Authors Dmitry Tishkovsky, F. Wolter, M. S. Sheremet, Michael Zakharyaschev

Publication date 27 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11591191_45

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other nonclassical logic (03B60) Automata and formal grammars in connection with logical questions (03D05) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Preferential Semantics for the Logic of Comparative Similarity over Triangular and Metric Models
• Tableau calculus for the logic of comparative similarity over arbitrary distance spaces
• Comparative concept similarity over minspaces: axiomatisation and tableaux calculus
• First-order logics for comparative similarity
• A modal logic framework for reasoning about comparative distances and topology

Cited in

(6)

• Preferential Semantics for the Logic of Comparative Similarity over Triangular and Metric Models
• CSymLean: A Theorem Prover for the Logic CSL over Symmetric Minspaces
• CSL-\textsf{lean}: a theorem-prover for the logic of comparative concept similarity
• Similarity relations and cover automata
• A modal logic framework for reasoning about comparative distances and topology
• Inducing semantic relations from conceptual spaces: a data-driven approach to plausible reasoning

This page was built for publication: Comparative Similarity, Tree Automata, and Diophantine Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387872)