Compilation of predicate abstractions in higher-order logic programming View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1991

AUTHORS

Weidong Chen , David Scott Warren

ABSTRACT

We explore higher-order logic programming and its relationship to computation in predicate calculus. The framework is based upon a logic of untyped λ-calculus which has a general model-theoretic semantics and whose equality theory corresponds to α-equivalence. The focus of the paper is on computing with predicate abstractions that are formalized by equivalence axioms with respect to a notion called top reduction. It is shown that, under certain conditions, computation with predicate abstractions can be compiled into predicate calculus and all most general answers are still preserved. More... »

PAGES

287-298

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-54444-5_106

DOI

http://dx.doi.org/10.1007/3-540-54444-5_106

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1009523971


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Computer Science & Engineering, Southern Methodist University, 75275-0122, Dallas, TX", 
          "id": "http://www.grid.ac/institutes/grid.263864.d", 
          "name": [
            "Computer Science & Engineering, Southern Methodist University, 75275-0122, Dallas, TX"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Chen", 
        "givenName": "Weidong", 
        "id": "sg:person.01207355664.95", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01207355664.95"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Computer Science Department, SUNY at Stony Brook, 11794-4400, Stony Brook, NY", 
          "id": "http://www.grid.ac/institutes/grid.36425.36", 
          "name": [
            "Computer Science Department, SUNY at Stony Brook, 11794-4400, Stony Brook, NY"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Warren", 
        "givenName": "David Scott", 
        "id": "sg:person.0611624774.02", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0611624774.02"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1991", 
    "datePublishedReg": "1991-01-01", 
    "description": "We explore higher-order logic programming and its relationship to computation in predicate calculus. The framework is based upon a logic of untyped \u03bb-calculus which has a general model-theoretic semantics and whose equality theory corresponds to \u03b1-equivalence. The focus of the paper is on computing with predicate abstractions that are formalized by equivalence axioms with respect to a notion called top reduction. It is shown that, under certain conditions, computation with predicate abstractions can be compiled into predicate calculus and all most general answers are still preserved.", 
    "editor": [
      {
        "familyName": "Maluszy\u0144ski", 
        "givenName": "Jan", 
        "type": "Person"
      }, 
      {
        "familyName": "Wirsing", 
        "givenName": "Martin", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-54444-5_106", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-54444-9", 
        "978-3-540-38362-8"
      ], 
      "name": "Programming Language Implementation and Logic Programming", 
      "type": "Book"
    }, 
    "keywords": [
      "higher-order logic programming", 
      "predicate abstraction", 
      "logic programming", 
      "model-theoretic semantics", 
      "predicate calculus", 
      "abstraction", 
      "equality theory", 
      "programming", 
      "equivalence axioms", 
      "computation", 
      "semantics", 
      "calculus", 
      "logic", 
      "framework", 
      "compilation", 
      "general answer", 
      "axioms", 
      "answers", 
      "notion", 
      "equivalence", 
      "focus", 
      "certain conditions", 
      "respect", 
      "theory", 
      "reduction", 
      "relationship", 
      "conditions", 
      "paper", 
      "general model-theoretic semantics", 
      "top reduction"
    ], 
    "name": "Compilation of predicate abstractions in higher-order logic programming", 
    "pagination": "287-298", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1009523971"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-54444-5_106"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-54444-5_106", 
      "https://app.dimensions.ai/details/publication/pub.1009523971"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:17", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_285.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-54444-5_106"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-54444-5_106'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-54444-5_106'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-54444-5_106'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-54444-5_106'


 

This table displays all metadata directly associated to this object as RDF triples.

105 TRIPLES      23 PREDICATES      56 URIs      49 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-54444-5_106 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Nfcd8417a429643bc887b4905addd71f1
4 schema:datePublished 1991
5 schema:datePublishedReg 1991-01-01
6 schema:description We explore higher-order logic programming and its relationship to computation in predicate calculus. The framework is based upon a logic of untyped λ-calculus which has a general model-theoretic semantics and whose equality theory corresponds to α-equivalence. The focus of the paper is on computing with predicate abstractions that are formalized by equivalence axioms with respect to a notion called top reduction. It is shown that, under certain conditions, computation with predicate abstractions can be compiled into predicate calculus and all most general answers are still preserved.
7 schema:editor N80e30a829a7a45afb657d9d47f466d0c
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Nee2cff0e465e469e853084bcfbd90db2
12 schema:keywords abstraction
13 answers
14 axioms
15 calculus
16 certain conditions
17 compilation
18 computation
19 conditions
20 equality theory
21 equivalence
22 equivalence axioms
23 focus
24 framework
25 general answer
26 general model-theoretic semantics
27 higher-order logic programming
28 logic
29 logic programming
30 model-theoretic semantics
31 notion
32 paper
33 predicate abstraction
34 predicate calculus
35 programming
36 reduction
37 relationship
38 respect
39 semantics
40 theory
41 top reduction
42 schema:name Compilation of predicate abstractions in higher-order logic programming
43 schema:pagination 287-298
44 schema:productId N7ea0757abd8d47d7ba3ee6724ef6baad
45 Nca2b1e01811147baaefd4ec0fc1648c3
46 schema:publisher N172dfce78a144a8b81a02cb84c2523f9
47 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009523971
48 https://doi.org/10.1007/3-540-54444-5_106
49 schema:sdDatePublished 2022-01-01T19:17
50 schema:sdLicense https://scigraph.springernature.com/explorer/license/
51 schema:sdPublisher N0b2b5593385f432dab116662ee1d37a3
52 schema:url https://doi.org/10.1007/3-540-54444-5_106
53 sgo:license sg:explorer/license/
54 sgo:sdDataset chapters
55 rdf:type schema:Chapter
56 N0b2b5593385f432dab116662ee1d37a3 schema:name Springer Nature - SN SciGraph project
57 rdf:type schema:Organization
58 N172dfce78a144a8b81a02cb84c2523f9 schema:name Springer Nature
59 rdf:type schema:Organisation
60 N223df219cb7e4b3e9e3c4e985f60ef3d schema:familyName Maluszyński
61 schema:givenName Jan
62 rdf:type schema:Person
63 N2d579bd849e34fa7af37f8d98be4b70e rdf:first sg:person.0611624774.02
64 rdf:rest rdf:nil
65 N643b86bfac7a4c2aae1111e2826ec193 rdf:first Nae508ed2659949919f66b708bd81c38f
66 rdf:rest rdf:nil
67 N7ea0757abd8d47d7ba3ee6724ef6baad schema:name dimensions_id
68 schema:value pub.1009523971
69 rdf:type schema:PropertyValue
70 N80e30a829a7a45afb657d9d47f466d0c rdf:first N223df219cb7e4b3e9e3c4e985f60ef3d
71 rdf:rest N643b86bfac7a4c2aae1111e2826ec193
72 Nae508ed2659949919f66b708bd81c38f schema:familyName Wirsing
73 schema:givenName Martin
74 rdf:type schema:Person
75 Nca2b1e01811147baaefd4ec0fc1648c3 schema:name doi
76 schema:value 10.1007/3-540-54444-5_106
77 rdf:type schema:PropertyValue
78 Nee2cff0e465e469e853084bcfbd90db2 schema:isbn 978-3-540-38362-8
79 978-3-540-54444-9
80 schema:name Programming Language Implementation and Logic Programming
81 rdf:type schema:Book
82 Nfcd8417a429643bc887b4905addd71f1 rdf:first sg:person.01207355664.95
83 rdf:rest N2d579bd849e34fa7af37f8d98be4b70e
84 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
85 schema:name Information and Computing Sciences
86 rdf:type schema:DefinedTerm
87 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
88 schema:name Computation Theory and Mathematics
89 rdf:type schema:DefinedTerm
90 sg:person.01207355664.95 schema:affiliation grid-institutes:grid.263864.d
91 schema:familyName Chen
92 schema:givenName Weidong
93 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01207355664.95
94 rdf:type schema:Person
95 sg:person.0611624774.02 schema:affiliation grid-institutes:grid.36425.36
96 schema:familyName Warren
97 schema:givenName David Scott
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0611624774.02
99 rdf:type schema:Person
100 grid-institutes:grid.263864.d schema:alternateName Computer Science & Engineering, Southern Methodist University, 75275-0122, Dallas, TX
101 schema:name Computer Science & Engineering, Southern Methodist University, 75275-0122, Dallas, TX
102 rdf:type schema:Organization
103 grid-institutes:grid.36425.36 schema:alternateName Computer Science Department, SUNY at Stony Brook, 11794-4400, Stony Brook, NY
104 schema:name Computer Science Department, SUNY at Stony Brook, 11794-4400, Stony Brook, NY
105 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...