Sciweavers

4513 search results - page 12 / 903
» Logic programming with satisfiability
Sort
View
OPODIS
2003
13 years 8 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
INTERSENSE
2006
ACM
14 years 1 months ago
Programming wireless sensor networks with logical neighborhoods
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Luca Mottola, Gian Pietro Picco
CORR
2006
Springer
130views Education» more  CORR 2006»
13 years 7 months ago
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...
Joseph Y. Halpern, Leandro Chaves Rêgo
FORMATS
2004
Springer
13 years 11 months ago
Some Progress in Satisfiability Checking for Difference Logic
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integra...
Scott Cotton, Eugene Asarin, Oded Maler, Peter Nie...
AAAI
2000
13 years 8 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski