Horn clause

Results: 49



#Item
1Removing Unnecessary Variables from Horn Clause Verification Conditions Emanuele De Angelis∗ and Fabio Fioravanti∗ Alberto Pettorossi∗

Removing Unnecessary Variables from Horn Clause Verification Conditions Emanuele De Angelis∗ and Fabio Fioravanti∗ Alberto Pettorossi∗

Add to Reading List

Source URL: hcvs2016.it.uu.se

- Date: 2016-04-02 04:08:34
    2Removing Unnecessary Variables from Horn Clause Verification Conditions E. De Angelis (1), F. Fioravanti (1) A. Pettorossi (2), M. ProiettiDEC, University ”G. d’Annunzio” of Chieti-Pescara, Italy

    Removing Unnecessary Variables from Horn Clause Verification Conditions E. De Angelis (1), F. Fioravanti (1) A. Pettorossi (2), M. ProiettiDEC, University ”G. d’Annunzio” of Chieti-Pescara, Italy

    Add to Reading List

    Source URL: hcvs2016.it.uu.se

    - Date: 2016-04-08 07:01:12
      3Solving non-linear Horn clauses using a linear Horn clause solver Bishoksan Kafle, John Gallagher and Pierre Ganty Roskilde University, Denmark and IMDEA Software Institute, Spain  HCVS’16 Eindhoven

      Solving non-linear Horn clauses using a linear Horn clause solver Bishoksan Kafle, John Gallagher and Pierre Ganty Roskilde University, Denmark and IMDEA Software Institute, Spain HCVS’16 Eindhoven

      Add to Reading List

      Source URL: hcvs2016.it.uu.se

      - Date: 2016-04-05 17:42:28
        4Solving non-linear Horn clauses using a linear Horn clause solver ∗ Bishoksan Kafle John P. Gallagher

        Solving non-linear Horn clauses using a linear Horn clause solver ∗ Bishoksan Kafle John P. Gallagher

        Add to Reading List

        Source URL: hcvs2016.it.uu.se

        - Date: 2016-04-02 04:08:34
          5Tutorial on Specialisation of Logic Programs J.P. Gallagher Department of Computer Science University of Bristol University Walk Bristol BS8 1TR, U.K.

          Tutorial on Specialisation of Logic Programs J.P. Gallagher Department of Computer Science University of Bristol University Walk Bristol BS8 1TR, U.K.

          Add to Reading List

          Source URL: repository.readscheme.org

          Language: English - Date: 2010-10-22 08:05:29
          6Part 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

          Add to Reading List

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

          Language: English - Date: 2009-06-05 11:15:41
          7ISBNISRN SICS/DSE An Automatic Partial Evaluator for Full Prolog

          ISBNISRN SICS/DSE An Automatic Partial Evaluator for Full Prolog

          Add to Reading List

          Source URL: repository.readscheme.org

          Language: English - Date: 2010-10-22 08:04:36
          8Finite Tree Automata in Horn Clause Transformations (Invited Talk) John P. Gallagher Roskilde University, Denmark and IMDEA Software Institute, Spain

          Finite Tree Automata in Horn Clause Transformations (Invited Talk) John P. Gallagher Roskilde University, Denmark and IMDEA Software Institute, Spain

          Add to Reading List

          Source URL: refal.botik.ru

          - Date: 2016-02-22 02:22:12
            9TESTIMONY VICKIE SUTTON PAUL WHITFIELD HORN PROFESSOR OF LAW, TEXAS TECH UNIVERSITY SCHOOL OF LAW BEFORE THE COMMITTEE ON STATE AFFAIRS CHAIRMAN, SENATOR ROBERT DUNCAN

            TESTIMONY VICKIE SUTTON PAUL WHITFIELD HORN PROFESSOR OF LAW, TEXAS TECH UNIVERSITY SCHOOL OF LAW BEFORE THE COMMITTEE ON STATE AFFAIRS CHAIRMAN, SENATOR ROBERT DUNCAN

            Add to Reading List

            Source URL: www.senate.texas.gov

            Language: English - Date: 2012-12-10 10:01:23