Sciweavers

553 search results - page 15 / 111
» Design Principles for a System to Teach Problem Solving by M...
Sort
View
CPAIOR
2010
Springer
13 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ENTCS
2007
91views more  ENTCS 2007»
13 years 7 months ago
A Logic for Reasoning about Generic Judgments
This paper presents an extension of a proof system for encoding generic judgments, the logic FOλ∆ of Miller and Tiu, with an induction principle. The logic FOλ∆ is itself an...
Alwen Tiu
IV
2002
IEEE
124views Visualization» more  IV 2002»
14 years 12 days ago
Numerical Solving of Geometric Constraints
: In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships called constraints between geometric elements. The problem is to der...
Samy Ait-Aoudia
IWC
2000
81views more  IWC 2000»
13 years 7 months ago
Steps to take before intelligent user interfaces become real
Intelligent user interfaces have been proposed as a means to overcome some of the problems that directmanipulation interfaces cannot handle, such as: information overflow problems...
Kristina Höök
ICWE
2005
Springer
14 years 1 months ago
MDA Transformations Applied to Web Application Development
Current Web generation techniques are mainly hard-coded for predefined architectures of Web applications. Consequently, there is a gap between Web design models and the final imple...
Santiago Meliá, Andreas Kraus, Nora Koch