Sciweavers

4401 search results - page 799 / 881
» Computing with Default Logic
Sort
View
JAIR
2010
111views more  JAIR 2010»
13 years 7 months ago
Grounding FO and FO(ID) with Bounds
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
Johan Wittocx, Maarten Mariën, Marc Denecker
JASIS
2010
125views more  JASIS 2010»
13 years 7 months ago
So mechanical or routine: The not original in Feist
The United States Supreme Court case of 1991, Feist Publications, Inc. v. Rural Tel. Service Co., continues to be highly significant for property in data and databases but remains...
Julian Warner
MST
2010
140views more  MST 2010»
13 years 7 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
PASTE
2010
ACM
13 years 7 months ago
Property-aware program sampling
Monitoring or profiling programs provides us with an understanding for its further improvement and analysis. Typically, for monitoring or profiling, the program is instrumented ...
Harish Narayanappa, Mukul S. Bansal, Hridesh Rajan
VL
2010
IEEE
216views Visual Languages» more  VL 2010»
13 years 7 months ago
Explanatory Debugging: Supporting End-User Debugging of Machine-Learned Programs
Many machine-learning algorithms learn rules of behavior from individual end users, such as taskoriented desktop organizers and handwriting recognizers. These rules form a “prog...
Todd Kulesza, Simone Stumpf, Margaret M. Burnett, ...