Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation...
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by in...
Abstract. The limitations of deductive logic-based approaches at deriving operational knowledge from ontologies may be overcome by inductive (instancebased) methods, which are usua...