1127 search results - page 174 / 226 » Theory Extension in ACL2(r) |
131
click to vote
ALP
1990
Springer
15 years 10 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
168
click to vote
ICALP
2007
Springer
15 years 10 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...
165
click to vote
3DPVT
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an alternate approach to the problem of structure from motion (SfM) with noisy point measurements. With no information available about the joint density of three-dimens...
159
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
163
click to vote
ASP
2003
Springer
15 years 9 months ago
2003
Springer
The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures: we show ho...