Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
By analogy with an approach widely used in physics, we consider a discrete set of base stations (BS) as a continuum of transmitters. This model allows us to establish a simple clos...
d Abstract) Carsten Sinz and Wolfgang K¨uchlin Symbolic Computation Group, WSI for Computer Science, University of T¨ubingen and Steinbeis Technology Transfer Center OIT, 72076 T...
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...