Line-Based Affine Reasoning in Euclidean Plane - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Line-Based Affine Reasoning in Euclidean Plane

Résumé

We consider the binary relations of parallelism and convergence between lines in a 2-dimensional affinespace. Associating with parallelism and convergence the binary predicates P and C and the modal connectives [ P] and [C], we consider a first-order theory based on these predicates and a modal logic based on these modal connectives. We investigate the axiomatization/completeness and the decidability/complexity of this first-order theory and this modal logic.

Dates et versions

hal-04000897 , version 1 (22-02-2023)

Identifiants

Citer

Philippe Balbiani, Tinko Tinchev. Line-Based Affine Reasoning in Euclidean Plane. 9th European Conference on Logics in Artificial Intelligence (JELIA 2004), Sep 2004, Lisbon, Portugal. pp.474-486, ⟨10.1007/978-3-540-30227-8_40⟩. ⟨hal-04000897⟩
5 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More