Horn-satisfiability

Results: 7



#Item
1Logic / Mathematical logic / Mathematics / Automated theorem proving / Propositional calculus / Rules of inference / Resolution / Boolean algebra / Literal / First-order logic / SLD resolution / Horn clause

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

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2009-06-05 11:15:41
2

1 A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2006-07-28 09:44:33
    3Electronic design automation / Formal methods / Logic in computer science / NP-complete problems / Vehicle Identification Number / Satisfiability Modulo Theories / FO / Kripke semantics / Theoretical computer science / Mathematical logic / Logic

    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

    Add to Reading List

    Source URL: research.microsoft.com

    Language: English - Date: 2014-05-07 12:02:15
    4NP-complete problems / Logic in computer science / Complexity classes / Boolean algebra / 2-satisfiability / Boolean satisfiability problem / Conjunctive normal form / Outerplanar graph / Planar graph / Theoretical computer science / Graph theory / Computational complexity theory

    Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades

    Add to Reading List

    Source URL: kups.ub.uni-koeln.de

    Language: English - Date: 2011-03-28 06:57:24
    5Formal methods / Logic in computer science / NP-complete problems / Constraint programming / Satisfiability Modulo Theories / Vehicle Identification Number / FO / Theoretical computer science / Applied mathematics / Electronic design automation

    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

    Add to Reading List

    Source URL: www.winterstiger.at

    Language: English - Date: 2014-05-21 11:37:06
    6Constraint programming / Logic in computer science / Logic programming / Programming paradigms / Constraint logic programming / Constraint satisfaction / Boolean satisfiability problem / Horn clause / Prolog / Theoretical computer science / Declarative programming / Software engineering

    A Constraint Satisfaction Approach to Tractable Theory Induction John Ahlgren and Shiu Yin Yuen City University of Hong Kong, Hong Kong, China [removed]

    Add to Reading List

    Source URL: lion.disi.unitn.it

    Language: English - Date: 2012-12-21 02:59:42
    7Propositional calculus / Logic programming / Logic in computer science / Boolean algebra / Automated theorem proving / Constraint logic programming / Resolution / Horn clause / Boolean satisfiability problem / Logic / Theoretical computer science / Mathematics

    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

    Add to Reading List

    Source URL: jmlr.org

    Language: English - Date: 2013-12-12 22:22:13
    UPDATE