Noetherianity and Combination Problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Noetherianity and Combination Problems

Résumé

In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-order logic by defining the class of Noetherian theories. Examples of theories in this class are Linear Arithmetics without ordering and the empty theory containing only a unary function symbol. Interestingly, it is possible to design a non-disjoint combination method for extensions of Noetherian theories. We investigate sufficient conditions for adding a temporal dimension to such theories in such a way that the decidability of the satisfiability problem for the quantifier-free fragment of the resulting temporal logic is guaranteed. This problem is firstly investigated for the case of Linear time Temporal Logic and then generalized to arbitrary modal/temporal logics whose propositional relativized satisfiability problem is decidable.

Dates et versions

inria-00576594 , version 1 (14-03-2011)

Identifiants

Citer

Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli. Noetherianity and Combination Problems. Frontiers of Combining Systems, Sep 2007, Liverpool, United Kingdom. pp.206-220, ⟨10.1007/978-3-540-74621-8_14⟩. ⟨inria-00576594⟩
79 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More