831 search results - page 80 / 167 » Coalgebraic Correspondence Theory |
111
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
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...
110
click to vote
FOSSACS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
107
click to vote
FPCA
1995
15 years 3 months ago
1995
In this paper we study the relationships between logic programming and functional programming, trying to answer the following basic question: to what extent is logic programming j...
108
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
93
Voted
IPCO
2010
15 years 1 months ago
2010
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tab...