Results 281 to 290 of about 164,088 (328)

Reachability logic: an efficient fragment of transitive closure logic

Logic Journal of IGPL, 2000
Reachability logic (\({\mathcal RL}\)) is defined. It is a fragment of \(\text{FO}^2(\text{TC})\) (with Boolean variables), i.e. a fragment of the restriction of first-order logic with transitive closure in which only two variables may appear in a formula. It is shown that PDL and \(\text{CTL}^\star\) can be embedded in reachability logic.
Alechina, Natasha, Immerman, Neil
openaire   +2 more sources

Logic Fragments: Coordinating Entities with Logic Programs

2016
Rigorous engineering of self-organising and self-adaptive systems is a challenging activity. Interactions with humans and unexpected entities, dependence on contextual information for self-organisation and adaptation represent just some of the factors complicating the coordination process among multiple entities of the system.
De Angelis, Francesco   +1 more
openaire   +2 more sources

Fragments of first order logic, I: universal Horn logic

Journal of Symbolic Logic, 1977
Let L be any finitary language. By restricting our attention to the universal Horn sentences of L and appealing to a semantical notion of logical consequence, we can formulate the universal Horn logic of L. The present paper provides some theorems about universal Horn logic that serve to distinguish it from the full first order predicate logic ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy