509 search results - page 54 / 102 » On the completeness of compositional reasoning methods |
LPNMR
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
CALCO
2005
Springer
14 years 2 months ago
2005
Springer
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...
HICSS
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper we consider the complete supply chain for a large pulp producer in Sweden. The supply chain is divided up in two parts, the pulp production planning problem and the ...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Visual recognition and detection are computationally intensive tasks and current research efforts primarily focus on solving them without considering the computational capability ...
PLILP
1993
Springer
14 years 28 days ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...