In this paper we show that incrementally stable nonlinear time–delay systems admit symbolic models which are approximately equivalent, in the sense of approximate bisimulation, ...
Giordano Pola, Pierdomenico Pepe, Maria Domenica D...
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
Given a propositional formula X, we present a mapping that constructs a general program P, such that the maximal models of X correspond to the stable models of P, after intersectin...
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...