Equivalences of logic programs View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1986

AUTHORS

M. J. Maher

ABSTRACT

For applications such as deductive databases employing the Open World Assumption, failed derivations have a lesser importance. In this case, use of the identical equivalences based upon the functional semantics [P] and the logical consequences of P allows the application of two different and powerful tools to reason about programs. In particular, these equivalences seem ideal for discussing the deductive structure of such deductive databases, independent of any particular state of the database of facts.When negation-as-failure is used in evaluating queries, the equivalence of completed programs is more appropriate. This equivalence is only slightly stronger than (high level) operational equivalence and the well-developed formalism of logic is available to facilitate reasoning about programs. More... »

PAGES

410-424

Book

TITLE

Third International Conference on Logic Programming

ISBN

978-3-540-16492-0
978-3-540-39831-8

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-16492-8_91

DOI

http://dx.doi.org/10.1007/3-540-16492-8_91

DIMENSIONS

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


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": "Dept. of Computer Science, University of Melbourne, USA", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "Dept. of Computer Science, University of Melbourne, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Maher", 
        "givenName": "M. J.", 
        "type": "Person"
      }
    ], 
    "datePublished": "1986", 
    "datePublishedReg": "1986-01-01", 
    "description": "For applications such as deductive databases employing the Open World Assumption, failed derivations have a lesser importance. In this case, use of the identical equivalences based upon the functional semantics [P] and the logical consequences of P allows the application of two different and powerful tools to reason about programs. In particular, these equivalences seem ideal for discussing the deductive structure of such deductive databases, independent of any particular state of the database of facts.When negation-as-failure is used in evaluating queries, the equivalence of completed programs is more appropriate. This equivalence is only slightly stronger than (high level) operational equivalence and the well-developed formalism of logic is available to facilitate reasoning about programs.", 
    "editor": [
      {
        "familyName": "Shapiro", 
        "givenName": "Ehud", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-16492-8_91", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-16492-0", 
        "978-3-540-39831-8"
      ], 
      "name": "Third International Conference on Logic Programming", 
      "type": "Book"
    }, 
    "keywords": [
      "deductive databases", 
      "open world assumption", 
      "database of facts", 
      "formalism of logic", 
      "functional semantics", 
      "world assumption", 
      "logic programs", 
      "deductive structure", 
      "database", 
      "operational equivalence", 
      "queries", 
      "semantics", 
      "logical consequence", 
      "applications", 
      "powerful tool", 
      "reasoning", 
      "logic", 
      "particular state", 
      "tool", 
      "program", 
      "equivalence", 
      "negation", 
      "formalism", 
      "derivation", 
      "use", 
      "assumption", 
      "fact", 
      "state", 
      "structure", 
      "less importance", 
      "importance", 
      "cases", 
      "failure", 
      "consequences", 
      "identical equivalences", 
      "such deductive databases"
    ], 
    "name": "Equivalences of logic programs", 
    "pagination": "410-424", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1011017227"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-16492-8_91"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-16492-8_91", 
      "https://app.dimensions.ai/details/publication/pub.1011017227"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-11-01T18:52", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/chapter/chapter_247.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-16492-8_91"
  }
]
 

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-16492-8_91'

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-16492-8_91'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-16492-8_91'

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-16492-8_91'


 

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

95 TRIPLES      23 PREDICATES      62 URIs      55 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-16492-8_91 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Ne1d3e7db983a4d22a5bf5b9c9c40f48e
4 schema:datePublished 1986
5 schema:datePublishedReg 1986-01-01
6 schema:description For applications such as deductive databases employing the Open World Assumption, failed derivations have a lesser importance. In this case, use of the identical equivalences based upon the functional semantics [P] and the logical consequences of P allows the application of two different and powerful tools to reason about programs. In particular, these equivalences seem ideal for discussing the deductive structure of such deductive databases, independent of any particular state of the database of facts.When negation-as-failure is used in evaluating queries, the equivalence of completed programs is more appropriate. This equivalence is only slightly stronger than (high level) operational equivalence and the well-developed formalism of logic is available to facilitate reasoning about programs.
7 schema:editor Nadb29515dc404c26bd8b507165ad8803
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Ncfe1455c48fe4e8a96e6ab47d449efea
12 schema:keywords applications
13 assumption
14 cases
15 consequences
16 database
17 database of facts
18 deductive databases
19 deductive structure
20 derivation
21 equivalence
22 fact
23 failure
24 formalism
25 formalism of logic
26 functional semantics
27 identical equivalences
28 importance
29 less importance
30 logic
31 logic programs
32 logical consequence
33 negation
34 open world assumption
35 operational equivalence
36 particular state
37 powerful tool
38 program
39 queries
40 reasoning
41 semantics
42 state
43 structure
44 such deductive databases
45 tool
46 use
47 world assumption
48 schema:name Equivalences of logic programs
49 schema:pagination 410-424
50 schema:productId N275115c7547a4196a050d1f73f480e18
51 N705acef816bd4e42a45532bec41d4b84
52 schema:publisher Nbf3e32869ffb478eaad0279ddc225b70
53 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011017227
54 https://doi.org/10.1007/3-540-16492-8_91
55 schema:sdDatePublished 2021-11-01T18:52
56 schema:sdLicense https://scigraph.springernature.com/explorer/license/
57 schema:sdPublisher N36937b7c4627498f883c8ad1c29b38cd
58 schema:url https://doi.org/10.1007/3-540-16492-8_91
59 sgo:license sg:explorer/license/
60 sgo:sdDataset chapters
61 rdf:type schema:Chapter
62 N275115c7547a4196a050d1f73f480e18 schema:name dimensions_id
63 schema:value pub.1011017227
64 rdf:type schema:PropertyValue
65 N36937b7c4627498f883c8ad1c29b38cd schema:name Springer Nature - SN SciGraph project
66 rdf:type schema:Organization
67 N3e01f92c856e4a67ae862ad12f1a6aae schema:affiliation grid-institutes:None
68 schema:familyName Maher
69 schema:givenName M. J.
70 rdf:type schema:Person
71 N5b43bb15f9224a769f2bcc76d0deba36 schema:familyName Shapiro
72 schema:givenName Ehud
73 rdf:type schema:Person
74 N705acef816bd4e42a45532bec41d4b84 schema:name doi
75 schema:value 10.1007/3-540-16492-8_91
76 rdf:type schema:PropertyValue
77 Nadb29515dc404c26bd8b507165ad8803 rdf:first N5b43bb15f9224a769f2bcc76d0deba36
78 rdf:rest rdf:nil
79 Nbf3e32869ffb478eaad0279ddc225b70 schema:name Springer Nature
80 rdf:type schema:Organisation
81 Ncfe1455c48fe4e8a96e6ab47d449efea schema:isbn 978-3-540-16492-0
82 978-3-540-39831-8
83 schema:name Third International Conference on Logic Programming
84 rdf:type schema:Book
85 Ne1d3e7db983a4d22a5bf5b9c9c40f48e rdf:first N3e01f92c856e4a67ae862ad12f1a6aae
86 rdf:rest rdf:nil
87 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
88 schema:name Information and Computing Sciences
89 rdf:type schema:DefinedTerm
90 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
91 schema:name Computation Theory and Mathematics
92 rdf:type schema:DefinedTerm
93 grid-institutes:None schema:alternateName Dept. of Computer Science, University of Melbourne, USA
94 schema:name Dept. of Computer Science, University of Melbourne, USA
95 rdf:type schema:Organization
 




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


...