Sciweavers

641 search results - page 12 / 129
» Embedding Finite Sets in a Logic Programming Language
Sort
View
ICALP
2007
Springer
15 years 3 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
AGP
2010
IEEE
15 years 4 months ago
Constraint Logic Programming
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Marco Gavanelli, Francesca Rossi
EMSOFT
2001
Springer
15 years 4 months ago
Giotto: A Time-Triggered Language for Embedded Programming
rovides an abstract programmer’s model for the implementation of embedded control systems with hard real-time constraints. A typical control application consists of periodic soft...
Thomas A. Henzinger, Benjamin Horowitz, Christoph ...
CORR
2010
Springer
124views Education» more  CORR 2010»
14 years 11 months ago
On Omega Context Free Languages which are Borel Sets of Infinite Rank
This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...
Olivier Finkel
ICLP
2009
Springer
16 years 10 days ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...