Sciweavers

1097 search results - page 113 / 220
» Revision Programming = Logic Programming Integrity Constra...
Sort
View
LPNMR
2009
Springer
15 years 8 months ago
Manifold Answer-Set Programs for Meta-reasoning
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
Wolfgang Faber, Stefan Woltran
139
Voted
JFP
2000
163views more  JFP 2000»
15 years 3 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
121
Voted
ICFP
2010
ACM
15 years 4 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
COMSWARE
2007
IEEE
15 years 9 months ago
OASiS: A Programming Framework for Service-Oriented Sensor Networks
Abstract— Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in...
Manish Kushwaha, Isaac Amundson, Xenofon D. Koutso...
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
16 years 24 days ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer