Constants and finite unary relations in qualitative constraint reasoning

Artificial Intelligence 257 (C):1-23 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2017.12.003

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,440

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Complexity classification in qualitative temporal constraint reasoning.Peter Jonsson & Andrei Krokhin - 2004 - Artificial Intelligence 160 (1-2):35-51.
Recursive unary algebras and trees.Bakhadyr Khoussainov - 1994 - Annals of Pure and Applied Logic 67 (1-3):213-268.
Decidable discriminator varieties from unary varieties.Stanley Burris, Ralph Mckenzie & Matthew Valeriote - 1991 - Journal of Symbolic Logic 56 (4):1355-1368.
Relational approach for a logic for order of magnitude qualitative reasoning with negligibility, non-closeness and distance.Joanna Golinska-Pilarek & Emilio Munoz Velasco - 2009 - Logic Journal of the IGPL 17 (4):375–394.
On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.
On Decidability of a Logic for Order of Magnitude Qualitative Reasoning with Bidirectional Negligibility.Joanna Golinska-Pilarek - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 255--266.
Logic, reasoning and the logical constants (engl version of "Logica, ragionamento e constanti logische".Pascal Engel - unknown
A Connection Based Approach to Common-sense Topological Description and Reasoning.N. M. GottsJ M. GoodayA G. Cohn - 1996 - The Monist 79 (1):51-75.
Different similarities.Miloš S. Kurilić - 2015 - Archive for Mathematical Logic 54 (7-8):839-859.
Finite Trees in Tense Logic.Bellissima Fabio & Cittadini Saverio - 1999 - Studia Logica 62 (2):121-140.
A Connection Based Approach to Common-sense Topological Description and Reasoning.A. G. Cohn - 1996 - The Monist 79 (1):51-75.
The Tableau Method for a Logical System Based on a Finite Poset.Abir Nour - 2002 - Journal of Applied Non-Classical Logics 12 (1):43-62.
Diophantine relations between rings of s-integers of fields of algebraic functions in one variable over constant fields of positive characteristic.Alexandra Shlapentokh - 1993 - Journal of Symbolic Logic 58 (1):158-192.
Modal Logics for Qualitative Spatial Reasoning.Brandon Bennett - 1996 - Logic Journal of the IGPL 4 (1):23-45.
Boolean sentence algebras: Isomorphism constructions.William P. Hanf & Dale Myers - 1983 - Journal of Symbolic Logic 48 (2):329-338.

Analytics

Added to PP
2020-12-22

Downloads
6 (#1,467,549)

6 months
3 (#984,658)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

The 116 reducts of (ℚ, <,a).Markus Junker & Martin Ziegler - 2008 - Journal of Symbolic Logic 73 (3):861-884.
Decidability of Definability.Manuel Bodirsky, Michael Pinsker & Todor Tsankov - 2013 - Journal of Symbolic Logic 78 (4):1036-1054.

View all 9 references / Add more references