1![Part 2: First-Order Logic 2.1 Syntax 2.2 Semantics 2.3 Models, Validity, Satisfiability 2.4 Algorithmic problems 2.5 Normal forms and Skolemization Part 2: First-Order Logic 2.1 Syntax 2.2 Semantics 2.3 Models, Validity, Satisfiability 2.4 Algorithmic problems 2.5 Normal forms and Skolemization](https://www.pdfsearch.io/img/59cecf91c3deb306c34a618247cc8a0d.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2009-06-05 11:15:41
|
---|
2![1 A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas 1 A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas](https://www.pdfsearch.io/img/5771699f3eda84c78ab075a5a6ce6535.jpg) | Add to Reading ListSource URL: www.cs.rice.eduLanguage: English - Date: 2006-07-28 09:44:33
|
---|
3![Resourceful Reachability as HORN-LA Josh Berdine, Nikolaj Bjørner, Samin Ishtiaq, Jael E. Kriener, and Christoph M. Wintersteiger Microsoft Research, University of Kent Abstract. The program verification tool SLAyer us Resourceful Reachability as HORN-LA Josh Berdine, Nikolaj Bjørner, Samin Ishtiaq, Jael E. Kriener, and Christoph M. Wintersteiger Microsoft Research, University of Kent Abstract. The program verification tool SLAyer us](https://www.pdfsearch.io/img/88126be5d6fbedf5202655ad1c61531c.jpg) | Add to Reading ListSource URL: research.microsoft.comLanguage: English - Date: 2014-05-07 12:02:15
|
---|
4![Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades](https://www.pdfsearch.io/img/20a64f65678f8f0e33a20b408d2114b1.jpg) | Add to Reading ListSource URL: kups.ub.uni-koeln.deLanguage: English - Date: 2011-03-28 06:57:24
|
---|
5![Resourceful Reachability as HORN-LA Josh Berdine, Nikolaj Bjørner, Samin Ishtiaq, Jael E. Kriener, and Christoph M. Wintersteiger Microsoft Research; University of Kent Abstract. The program verification tool SLAyer us Resourceful Reachability as HORN-LA Josh Berdine, Nikolaj Bjørner, Samin Ishtiaq, Jael E. Kriener, and Christoph M. Wintersteiger Microsoft Research; University of Kent Abstract. The program verification tool SLAyer us](https://www.pdfsearch.io/img/b9b053395cbf8c5f6bbaa952a60d371c.jpg) | Add to Reading ListSource URL: www.winterstiger.atLanguage: English - Date: 2014-05-21 11:37:06
|
---|
6![A Constraint Satisfaction Approach to Tractable Theory Induction John Ahlgren and Shiu Yin Yuen City University of Hong Kong, Hong Kong, China [removed] A Constraint Satisfaction Approach to Tractable Theory Induction John Ahlgren and Shiu Yin Yuen City University of Hong Kong, Hong Kong, China [removed]](https://www.pdfsearch.io/img/7f875e03a344769ab02080e9e6fc317c.jpg) | Add to Reading ListSource URL: lion.disi.unitn.itLanguage: English - Date: 2012-12-21 02:59:42
|
---|
7![Journal of Machine Learning Research[removed]3681 Submitted 4/12; Revised 7/13; Published[removed]Efficient Program Synthesis Using Constraint Satisfaction in Inductive Logic Programming Journal of Machine Learning Research[removed]3681 Submitted 4/12; Revised 7/13; Published[removed]Efficient Program Synthesis Using Constraint Satisfaction in Inductive Logic Programming](https://www.pdfsearch.io/img/b7453d7d89f1ce8ad5234164666124c2.jpg) | Add to Reading ListSource URL: jmlr.orgLanguage: English - Date: 2013-12-12 22:22:13
|
---|