Sciweavers

1342 search results - page 86 / 269
» Ordered Programs as Abductive Systems
Sort
View
CASCON
1993
117views Education» more  CASCON 1993»
13 years 11 months ago
Documenting-in-the-large vs. documenting-in-the-small
There is a signi cant di erence between documentinglarge programs and documenting small ones. By large programs we mean on the order of 1,000,000 lines, usually written by many di...
Scott R. Tilley
INFORMS
1998
150views more  INFORMS 1998»
13 years 9 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
SIGSOFT
2008
ACM
14 years 10 months ago
Profile-guided program simplification for effective testing and analysis
Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are oft...
Lingxiao Jiang, Zhendong Su
LPNMR
2009
Springer
14 years 2 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
FUIN
2010
130views more  FUIN 2010»
13 years 8 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi