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-12-01T20:02", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/chapter/chapter_272.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 Ne0d97896c8ac47658684614177aec765
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 N4ea031be45f245c6880a2a4ec16bc272
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Nb6e76a90c23748f59721c7815af43746
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 N90c429f4839c4ac48878eb6eac1aabdd
51 Nd0c346155a3245e89bc42c4324b0e6e8
52 schema:publisher Nd654d3e391624f909e3cb4e1757dc00f
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-12-01T20:02
56 schema:sdLicense https://scigraph.springernature.com/explorer/license/
57 schema:sdPublisher N7fe0265706a04dd4a7a0d73935e42fd4
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 N3e8d2e57fea64d75b55732705fbb0621 schema:affiliation grid-institutes:None
63 schema:familyName Maher
64 schema:givenName M. J.
65 rdf:type schema:Person
66 N4ea031be45f245c6880a2a4ec16bc272 rdf:first Nbda9c7e4a4c544699af9ae12542a25e8
67 rdf:rest rdf:nil
68 N7fe0265706a04dd4a7a0d73935e42fd4 schema:name Springer Nature - SN SciGraph project
69 rdf:type schema:Organization
70 N90c429f4839c4ac48878eb6eac1aabdd schema:name doi
71 schema:value 10.1007/3-540-16492-8_91
72 rdf:type schema:PropertyValue
73 Nb6e76a90c23748f59721c7815af43746 schema:isbn 978-3-540-16492-0
74 978-3-540-39831-8
75 schema:name Third International Conference on Logic Programming
76 rdf:type schema:Book
77 Nbda9c7e4a4c544699af9ae12542a25e8 schema:familyName Shapiro
78 schema:givenName Ehud
79 rdf:type schema:Person
80 Nd0c346155a3245e89bc42c4324b0e6e8 schema:name dimensions_id
81 schema:value pub.1011017227
82 rdf:type schema:PropertyValue
83 Nd654d3e391624f909e3cb4e1757dc00f schema:name Springer Nature
84 rdf:type schema:Organisation
85 Ne0d97896c8ac47658684614177aec765 rdf:first N3e8d2e57fea64d75b55732705fbb0621
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)


...