24 search results - page 4 / 5 » Automatic Generation of Classification Theorems for Finite A... |
ICALP
2007
Springer
14 years 11 days 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...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
ML
2006
ACM
13 years 8 months ago
2006
ACM
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
TAP
2010
Springer
13 years 6 months ago
2010
Springer
We present QuickSpec, a tool that automatically generates algebraic specifications for sets of pure functions. The tool is based on testing, rather than static analysis or theorem ...
KBSE
1999
IEEE
14 years 24 days ago
1999
IEEE
Many domain specialists are not familiar or comfortable with formal notations and formal tools like theorem provers or model generators. To address this problem we developed Attem...