Sciweavers

599 search results - page 82 / 120
» Integrating answer set programming and constraint logic prog...
Sort
View
143
Voted
SARA
2009
Springer
15 years 10 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers
149
Voted
AOSD
2007
ACM
15 years 7 months ago
A static aspect language for checking design rules
Design rules express constraints on the behavior and structure of a program. These rules can help ensure that a program follows a set of established practices, and avoids certain ...
Clint Morgan, Kris De Volder, Eric Wohlstadter
139
Voted
LANMR
2007
15 years 5 months ago
Handling Exceptions in nonmonotonic reasoning
Abstract We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, chang...
Marcelino C. Pequeno, Rodrigo de M. S. Veras, Wlad...
155
Voted
AIIA
2005
Springer
15 years 9 months ago
Handling Continuous-Valued Attributes in Incremental First-Order Rules Learning
Machine Learning systems are often distinguished according to the kind of representation they use, which can be either propositional or first-order logic. The framework working wi...
Teresa Maria Altomare Basile, Floriana Esposito, N...
93
Voted
CORR
2007
Springer
68views Education» more  CORR 2007»
15 years 3 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella