4513 search results - page 785 / 903 » Logic programming with satisfiability |
131
click to vote
ENTCS
2007
15 years 3 months ago
2007
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...
168
Voted
DEDS
2000
15 years 3 months ago
2000
In this paper, we present the integration of controller synthesis techniques in the SIGNAL environment through the description of a tool dedicated to the incremental construction o...
152
click to vote
PPDP
2010
Springer
15 years 1 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
153
click to vote
IEEEPACT
2009
IEEE
15 years 1 months ago
2009
IEEE
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
158
click to vote
DLT
2010
15 years 4 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...