We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...
We propose a rigorous definition of the notion of typicality, making use of the strict partial order naturally induced among the objects at hand by a given concept. This perspecti...
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with stri...
PLC-Automata are a class of real-time automata suitable to describe the behavior of polling real-time systems. PLC-Automata can be compiled to source code for PLCs, a hardware wide...