Comparative Similarity, Tree Automata, and Diophantine Equations
From MaRDI portal
Publication:5387872
DOI10.1007/11591191_45zbMath1143.68600OpenAlexW1528334223MaRDI QIDQ5387872
Dmitry Tishkovsky, Frank Wolter, Mikhaĭl Sergeevich Sheremet, Michael Zakharyashchev
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
Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items
CSL-lean: A Theorem-prover for the Logic of Comparative Concept Similarity, Preferential Semantics for the Logic of Comparative Similarity over Triangular and Metric Models, Inducing semantic relations from conceptual spaces: a data-driven approach to plausible reasoning, A modal logic framework for reasoning about comparative distances and topology, CSymLean: A Theorem Prover for the Logic CSL over Symmetric Minspaces