Sciweavers

2834 search results - page 275 / 567
» Representing Trees with Constraints
Sort
View
ESOP
2009
Springer
15 years 10 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
AAAI
2008
15 years 9 months ago
Error Classification in Action Descriptions: A Heuristic Approach
Action languages allow to formally represent and reason about actions in a highly declarative manner. In recent work, revision and management of conflicts for domain descriptions ...
Thomas Eiter, Michael Fink, Ján Senko
FLAIRS
2007
15 years 9 months ago
A Model for Qualitative Spatial Reasoning Combining Topology, Orientation and Distance
Much work has been done in the area of qualitative spatial reasoning over the past years, with application in various domains. However, existing models only capture particular asp...
David Brageul, Hans W. Guesgen
ASPDAC
2005
ACM
92views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Partitioning and placement for buildable QCA circuits
— Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chem...
Ramprasad Ravichandran, Michael T. Niemier, Sung K...
CP
2008
Springer
15 years 8 months ago
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
Eric I. Hsu, Christian J. Muise, J. Christopher Be...