Sciweavers

136 search results - page 4 / 28
» Integrating Answer Set Reasoning with Constraint Solving Tec...
Sort
View
LPNMR
2009
Springer
14 years 8 days 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
ICLP
2009
Springer
14 years 8 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
LPNMR
2007
Springer
14 years 1 months ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele
CACM
2010
113views more  CACM 2010»
13 years 7 months ago
Reasoning about the unknown in static analysis
Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as ...
Isil Dillig, Thomas Dillig, Alex Aiken
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
13 years 7 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...