Horn Clauses in Hybrid-Dynamic First-Order Logic

by   Daniel Găină, et al.

We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop extends (many-sorted) first-order logic with features that are common to hybrid logics and to dynamic logics. This provides certain key advantages for dealing with reconfigurable systems, such as: (a) a signature of nominals, including operation and relation symbols, that allows references to specific possible worlds / system configurations -- as in the case of hybrid logics; (b) distinguished signatures of rigid and flexible symbols, where the rigid symbols are interpreted uniformly across possible worlds; this supports a rigid form of quantification, which ensures that variables have the same interpretation regardless of the possible world where they are evaluated; (c) hybrid terms, which increase the expressive power of the logic in the context of rigid symbols; and (d) modal operators over dynamic-logic actions, which are defined as regular expressions over binary nominal relations. We then study Horn clauses in this hybrid-dynamic logic, and develop a series of results that lead to an initial-semantics theorem for arbitrary sets of clauses. This shows that a significant fragment of hybrid-dynamic first-order logic has good computational properties, and can serve as a basis for defining executable languages for reconfigurable systems. Lastly, we set out the foundations of logic programming in this fragment by proving a hybrid-dynamic variant of Herbrand's theorem, which reduces the semantic entailment of a logic-programming query by a program to the search of a suitable answer substitution.


page 1

page 2

page 3

page 4


Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics

We investigate the expressive power of the two main kinds of program log...

Many-Sorted Hybrid Modal Languages

We continue our investigation into hybrid polyadic multi-sorted logic wi...

An Iterative Fixpoint Semantics for MKNF Hybrid Knowledge Bases with Function Symbols

Hybrid Knowledge Bases based on Lifschitz's logic of Minimal Knowledge w...

The Modal Logic of Stepwise Removal

We investigate the modal logic of stepwise removal of objects, both for ...

Dynamic Reasoning Systems

A dynamic reasoning system (DRS) is an adaptation of a conventional for...

Nonmonotonic Reasoning as a Temporal Activity

A dynamic reasoning system (DRS) is an adaptation of a conventional for...

DReAM: Dynamic Reconfigurable Architecture Modeling (full paper)

Modern systems evolve in unpredictable environments and have to continuo...

Please sign up or login with your details

Forgot password? Click here to reset