Sciweavers

1613 search results - page 89 / 323
» Functional and Constraint Logic Programming
Sort
View
ICALP
2009
Springer
16 years 4 months ago
Weak Alternating Timed Automata
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
Pawel Parys, Igor Walukiewicz
ICALP
2007
Springer
15 years 7 months ago
Affine Systems of Equations and Counting Infinitary Logic
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
Albert Atserias, Andrei A. Bulatov, Anuj Dawar
138
Voted
FLOPS
2008
Springer
15 years 5 months ago
EasyCheck - Test Data for Free
Abstract. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize t...
Jan Christiansen, Sebastian Fischer
120
Voted
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 3 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
125
Voted
DFG
2004
Springer
15 years 9 months ago
A Unifying Semantics for Sequential Function Charts
Programmable Logic Controllers (PLC) are widely used as device controllers for assembly lines, chemical processes, or power plants. Sequential Function Charts (SFC) form one of the...
Nanette Bauer, Ralf Huuck, Ben Lukoschus, Sebastia...