Sciweavers

1021 search results - page 58 / 205
» Concepts in Proof Planning
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 8 months ago
Mapping Semantic Networks to Undirected Networks
Abstract--There exists an injective, information-preserving function that maps a semantic network (i.e a directed labeled network) to a directed network (i.e. a directed unlabeled ...
Marko A. Rodriguez
JAR
2011
112views more  JAR 2011»
13 years 3 months ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
MST
2010
122views more  MST 2010»
13 years 3 months ago
Self-Referential Justifications in Epistemic Logic
This paper is devoted to the study of self-referential proofs and/or justifications, i.e., valid proofs that prove statements about these same proofs. The goal is to investigate wh...
Roman Kuznets
ECAI
2004
Springer
14 years 2 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
CORR
2011
Springer
143views Education» more  CORR 2011»
13 years 14 days ago
Towards Understanding and Harnessing the Potential of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
Paul Beame, Henry A. Kautz, Ashish Sabharwal