We introduce Information Bearing Relation Systems (IBRS) as an abstraction of many logical systems. We then define a general semantics for IBRS, and show that a special case of IBRS generalizes in a very natural way preferential semantics and solves open representation problems for weak logical systems. This is possible, as we can ”break” the strong coherence properties of preferential structur...

We introduce a number of paraconsistent semantics, including three-valued and four-valued semantics, for the description logic SROIQ, which is the logical foundation of OWL 2. We then study the relationship between the semantics and paraconsistent reasoning in SROIQ w.r.t. some of them through a translation into the traditional semantics. We also present a formalization of rough concepts in SROIQ.

In this paper, we address the problem of defining a fixpoint semantics for Constraint Handling Rules (CHR) that captures the behavior of both simplification and propagation rules in a sound and complete way with respect to their declarative semantics. Firstly, we show that the logical reading of states with respect to a set of simplification rules can be characterized by a least fixpoint over t...

This paper introduces a game semantics for Arithmetic with various sub-classical logics that have implication as a primitive connective. This semantics clarifies the infinitary sequent calculus that the authors proposed for intuitionistic arithmetic with Excluded Middle for Sigma-0-1-formulas, a formal system motivated by proof mining and by the study of monotonic learning, for which no game se...

This paper describes a natural language processing system implemented at Hewlett-Packard's Computer Research Center. The system's main components are: a Generalized Phrase Structure Grammar (GPSG); a top-down parser; a logic t ransducer that outputs a f i r s t o rde r logical representat ion; and a "disambiguator" that uses sortal information to convert "normal-form" f i r s t o rde r logical ...

A common practice in conceptual modeling is to divide the model into intensional and extensional parts. Although very intuitive, this approach falls short in many complex domains, where the borderline between the two parts is not clear-cut. Therefore, OWL-Full, the most expressive of the Semantic Web ontology languages, allows mixing the intensional and the extensional model by a feature we ref...

We deene a simple logical semantics based on minimal models in Lukasiewicz's 3-valued logic, L 3. On normal logic programs it is equivalent to the well-founded semantics (WFS), and on disjunctive programs it is equivalent to the P-stable semantics of Eiter, Leone and Saccc a, hence to Przymusinski's 3-valued stable semantics. One advantage is that it is char-acterised by simple conditions on mo...

Esterel is a synchronous programming language where processes interact through signals. The logical semantics of this language express the meaning of each syntactic constructions, knowing a priori the set of emitted signals. Nevertheless, a special case have to be made for local signals, making the semantics non-deterministic. In this paper, we propose a new logical semantics where the rules ar...

Reasoning about credential-based systems such as SDSI, SPKI is one of today’s security challenges. The representation and reasoning problem for this (simple) public key infrastructure is challenging: we need to represent permissions, naming and identities of agents and complex naming constructions (Blackburn’s office-mate is M4M’s PC-Chair’s Colleague), then we need to reason about intervals of...