2343 search results - page 89 / 469 » Structure and Interpretation of Computer Programs |
167
click to vote
JMLR
2008
15 years 4 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
130
click to vote
LICS
2007
IEEE
15 years 11 months ago
2007
IEEE
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
159
click to vote
AGP
1999
IEEE
15 years 9 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
157
click to vote
CP
1997
Springer
15 years 9 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
170
click to vote
AMAST
1991
Springer
15 years 8 months ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...