José Júlio Alferes

Semantic Sensor Web is a new trend of research integrating Semantic Web technologies with sensor networks. It uses Semantic Web standards to describe both the data produced by the sensors, but also the sensors and their networks, which enables interoperability of sensor networks, and provides a way to formally analyze and reason about these networks. Since sensors produce data at a very high rate, they require solutions to reason efficiently about what complex events occur based on the data captured. Nevertheless, besides detecting complex events, sensor based applications also need to execute actions in response to these events, and in some cases, to execute these actions in a transactional way. In this paper we propose TRev as a solution to combine the detection of complex events with the execution of transactions for these domains. TRev is an abstract logic to model and execute reactive transactions. The logic is parametric on a pair of oracles defining the basic primitives of the domain, which makes it suitable for a wide range of applications. In this paper we provide oracle instantiations combining RDF/OWL and relational database semantics for TRev Afterwards, based on these oracles, we illustrate how TRev can be useful for these domains.

Event-Condition-Action languages are the commonly accepted para- digm to express and model the behavior of reactive systems. While numerous Event-Condition-Action languages have been proposed in the literature, differing e.g. on the expressivity of the language and on its operational behavior, existing Event-Condition-Action languages do not generally support the action compo- nent to be formulated as a transaction. In this paper, sustaining that it is important to execute transactions in reactive languages, we propose an Event-Condition- Transaction language, based on an extension of Transaction Logic. This exten- sion, called Transaction Logic with Events (T Rev ), combines reasoning about the execution of transactions with the ability to detect complex events. An impor- tant characteristic of T Rev is that it takes a choice function as a parameter of the theory, leaving open the behavioral decisions of the logic, and thereby allowing it to be suitable for a wide-spectrum of application scenarios like Semantic Web, multi-agent systems, databases, etc. We start by showing how T Rev can be used as an Event-Condition-Action language where actions are considered as transac- tions, and how to differently instantiate this choice function to achieve different operational behaviors. Then, based on a particular operational instantiation of the logic, we present a procedure that is sound and complete w.r.t. the semantics and that is able to execute T Rev programs

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

n/a

TheRuleInterchangeFormatProductionRuleDialect(RIF- PRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operationally via labeled ter- minal transition systems.
In this paper, we introduce a declarative logical characterization of the full default semantics of RIF-PRD based on Answer Set Programming (ASP), including matching, conflict resolution and acting.
Our proposal to the semantics of RIF-PRD enjoys several features. Being based on ASP, it enables a straightforward integration with Logic Programming rule based technology, namely for reasoning and acting with ontologies. Then, its full declarative logical character facilitates the in- vestigation of formal properties of RIF-PRD itself. Furthermore, it turns out that our characterization based on ASP is flexible enough so that new conflict resolution semantics for RIF-PRD can easily be defined and encoded. Finally, it immediately serves as the declarative specification of an implementation, whose prototype we developed.

Ontologies and rules are usually loosely coupled in knowledge rep- resentation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rules use non-monotonic, closed-world reasoning. One ex- ception is the tightly-coupled framework of Minimal Knowledge and Negation as Failure (MKNF), which allows statements about individuals to be jointly derived via entailment from an ontology and inferences from rules. Nonetheless, the prac- tical usefulness of MKNF has not always been clear, although recent work has formalized a general resolution-based method for querying MKNF when rules are taken to have the well-founded semantics, and the ontology is modeled by a general Oracle. That work leaves open what algorithms should be used to relate the entailments of the ontology and the inferences of rules. In this paper we pro- vide such algorithms, and describe the implementation of a query-driven system, CDF-Rules, for hybrid knowledge bases combining both (non-monotonic) rules under the well-founded semantics and a (monotonic) ontology, represented by a CDF (ALCQ) theory.

Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic program- ming is that, instead of atomic first-order formulas, a parametrized logic program reasons about formulas of a given parameter logic. Of course, the main challenge is to define the semantics of such general programs. In this work we introduce the novel definitions along with some motivating examples. This approach allows us to prove general results that can be instantiated for every particular choice of the parameter logic. Impor- tant general results we can prove include the existence of semantics and the alternating fix-point theorem of well-founded semantics. To reenforce the soundness of our general framework we show that some known approaches in the literature of logic programming, such as paraconsistent answer-sets and the MKNF semantics for hybrid knowledge bases, are obtained as particular choices of the parameter logic.

A general top-down algorithmization for the Well-Founded MKNF Semantics - a semantics for combining rules and
ontologies - was recently defined based on an extension of SLG resolution for Logic Programming with an abstract oracle to the parametric ontology language. Here we provide a concrete oracle with practical usage, namely for EL+ which is tractable for reasoning tasks like subsumption. We show that the defined oracle remains tractable
(wrt. data complexity) so that the combined (query-driven) approach of non-monotonic rules with that oracle is tractable as well.