Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths

Authors:
Davide Bresolin;Valentin Goranko;Angelo Montanari;Guido Sciavicco
Affiliations:
-;-;-;-
Venue:
SEFM '09 Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
Year:
2009

Citing 0
Cited 4

Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders

Electronic Notes in Theoretical Computer Science (ENTCS)
Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional notions of refinement of algebraic specifications, based on signature morphisms, are often too rigid to capture a number of relevant transformations in the context of software design, reuse and adaptation. This paper proposes an alternative notion of specification refinement, building on recent work on logic interpretation. The concept is discussed, its theory partially developed, its use illustrated through a number of examples.