enter search term and/or author name
Super-Solutions: Succinctly Representing Solutions in Abductive Annotated Probabilistic Temporal Logic
Cristian Molinaro, Amy Sliva, V. S. Subrahmanian
Article No.: 18
Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn) rules of the form “formula G becomes true Δt time units after formula...
Complexity Classifications for Logic-Based Argumentation
Nadia Creignou, Uwe Egly, Johannes Schmidt
Article No.: 19
We consider logic-based argumentation in which an argument is a pair (Φ, α), where the support Φ is a minimal consistent set of formulae taken from a given knowledge base (usually denoted by Δ) that entails the claim α (a...
In this work, we present LoCo, a fragment of classical first-order logic carefully tailored for expressing technical product configuration problems. The core feature of LoCo is that the number of components used in configurations does not have to...
Focusing, introduced by Jean-Marc Andreoli in the context of classical linear logic [Andreoli 1992], defines a normal form for sequent calculus derivations that cuts down on the number of possible derivations by eagerly applying invertible rules...
Model-Checking Linear-Time Properties of Quantum Systems
Mingsheng Ying, Yangjia Li, Nengkun Yu, Yuan Feng
Article No.: 22
We define a formal framework for reasoning about linear-time properties of quantum systems in which quantum automata are employed in the modeling of systems and certain (closed) subspaces of state Hilbert spaces are used as the atomic propositions...
A Certified Reduction Strategy for Homological Image Processing
María Poza, César Domínguez, Jónathan Heras, Julio Rubio
Article No.: 23
The analysis of digital images using homological procedures is an outstanding topic in the area of Computational Algebraic Topology. In this article, we describe a certified reduction strategy to deal with digital images, but one...
We study finite automata running over infinite binary trees. A run of such an automaton over an input tree is a tree labeled by control states of the automaton: the labeling is built in a top-down fashion and should be consistent with the...
A Cookbook for Temporal Conceptual Data Modelling with Description Logics
Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev
Article No.: 25
We design temporal description logics (TDLs) suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions...