Evaluation Techniques for Disjunctive Logic Programs View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1994

AUTHORS

Dietmar Seipel , Hans Argenton

ABSTRACT

Non—Horn programs containing disjunctive rules allow for more advanced applications of deductive databases. But the inference process dealing with rapidly increasing amounts of disjunctive facts becomes much more intricate, because of the problem of finding resolvable atoms in the facts.We present an efficient implementation of the disjunctive consequence operator Tpsbased on a compact data structure for disjunctive facts that speeds up the combinatorial search in a TPs-hyperresolution step. More... »

PAGES

458-462

Book

TITLE

Operations Research ’93

ISBN

978-3-7908-0794-3
978-3-642-46955-8

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-46955-8_114

DOI

http://dx.doi.org/10.1007/978-3-642-46955-8_114

DIMENSIONS

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


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": "University of T\u00fcbingen Sand 13, D - 72076, T\u00fcbingen, Germany", 
          "id": "http://www.grid.ac/institutes/grid.10392.39", 
          "name": [
            "University of T\u00fcbingen Sand 13, D - 72076, T\u00fcbingen, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Seipel", 
        "givenName": "Dietmar", 
        "id": "sg:person.014335443074.50", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014335443074.50"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of T\u00fcbingen Sand 13, D - 72076, T\u00fcbingen, Germany", 
          "id": "http://www.grid.ac/institutes/grid.10392.39", 
          "name": [
            "University of T\u00fcbingen Sand 13, D - 72076, T\u00fcbingen, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Argenton", 
        "givenName": "Hans", 
        "id": "sg:person.010114327577.61", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010114327577.61"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1994", 
    "datePublishedReg": "1994-01-01", 
    "description": "Non\u2014Horn programs containing disjunctive rules allow for more advanced applications of deductive databases. But the inference process dealing with rapidly increasing amounts of disjunctive facts becomes much more intricate, because of the problem of finding resolvable atoms in the facts.We present an efficient implementation of the disjunctive consequence operator Tpsbased on a compact data structure for disjunctive facts that speeds up the combinatorial search in a TPs-hyperresolution step.", 
    "editor": [
      {
        "familyName": "Bachem", 
        "givenName": "Achim", 
        "type": "Person"
      }, 
      {
        "familyName": "Derigs", 
        "givenName": "Ulrich", 
        "type": "Person"
      }, 
      {
        "familyName": "J\u00fcnger", 
        "givenName": "Michael", 
        "type": "Person"
      }, 
      {
        "familyName": "Schrader", 
        "givenName": "Rainer", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-46955-8_114", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-7908-0794-3", 
        "978-3-642-46955-8"
      ], 
      "name": "Operations Research \u201993", 
      "type": "Book"
    }, 
    "keywords": [
      "disjunctive facts", 
      "compact data structure", 
      "disjunctive logic programs", 
      "deductive databases", 
      "data structure", 
      "combinatorial search", 
      "inference process", 
      "efficient implementation", 
      "logic programs", 
      "consequence operator", 
      "disjunctive rules", 
      "advanced applications", 
      "evaluation techniques", 
      "implementation", 
      "database", 
      "search", 
      "operators", 
      "rules", 
      "applications", 
      "technique", 
      "program", 
      "fact", 
      "step", 
      "process", 
      "amount", 
      "structure", 
      "problem", 
      "atoms"
    ], 
    "name": "Evaluation Techniques for Disjunctive Logic Programs", 
    "pagination": "458-462", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1032470886"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-46955-8_114"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-46955-8_114", 
      "https://app.dimensions.ai/details/publication/pub.1032470886"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-06-01T22:35", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220601/entities/gbq_results/chapter/chapter_432.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-46955-8_114"
  }
]
 

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/978-3-642-46955-8_114'

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/978-3-642-46955-8_114'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-46955-8_114'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-46955-8_114'


 

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

110 TRIPLES      23 PREDICATES      54 URIs      47 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-46955-8_114 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N9b88385ea68c4b06946bb412246d3bda
4 schema:datePublished 1994
5 schema:datePublishedReg 1994-01-01
6 schema:description Non—Horn programs containing disjunctive rules allow for more advanced applications of deductive databases. But the inference process dealing with rapidly increasing amounts of disjunctive facts becomes much more intricate, because of the problem of finding resolvable atoms in the facts.We present an efficient implementation of the disjunctive consequence operator Tpsbased on a compact data structure for disjunctive facts that speeds up the combinatorial search in a TPs-hyperresolution step.
7 schema:editor Nf8b0e633216042468ace44e80e58cf9f
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Nca7f6bf871834a3eaf347acee65da9eb
12 schema:keywords advanced applications
13 amount
14 applications
15 atoms
16 combinatorial search
17 compact data structure
18 consequence operator
19 data structure
20 database
21 deductive databases
22 disjunctive facts
23 disjunctive logic programs
24 disjunctive rules
25 efficient implementation
26 evaluation techniques
27 fact
28 implementation
29 inference process
30 logic programs
31 operators
32 problem
33 process
34 program
35 rules
36 search
37 step
38 structure
39 technique
40 schema:name Evaluation Techniques for Disjunctive Logic Programs
41 schema:pagination 458-462
42 schema:productId N091d3385ac7b481998d3ee5c4dc07312
43 Nb66c05f7c72a4659a6511ffa0216bc45
44 schema:publisher Nfb652ea303c843de99f1cb737ec0ec76
45 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032470886
46 https://doi.org/10.1007/978-3-642-46955-8_114
47 schema:sdDatePublished 2022-06-01T22:35
48 schema:sdLicense https://scigraph.springernature.com/explorer/license/
49 schema:sdPublisher N1cf5b207c27a44a5bc8d36f682653688
50 schema:url https://doi.org/10.1007/978-3-642-46955-8_114
51 sgo:license sg:explorer/license/
52 sgo:sdDataset chapters
53 rdf:type schema:Chapter
54 N02925cbd746e40a09fc04a1906aa2347 schema:familyName Schrader
55 schema:givenName Rainer
56 rdf:type schema:Person
57 N091d3385ac7b481998d3ee5c4dc07312 schema:name dimensions_id
58 schema:value pub.1032470886
59 rdf:type schema:PropertyValue
60 N1cf5b207c27a44a5bc8d36f682653688 schema:name Springer Nature - SN SciGraph project
61 rdf:type schema:Organization
62 N3823b132b9c743b8b03d514deb35f79d rdf:first Ne1cc855a61f04ccaa0d4596341c59f64
63 rdf:rest Na1d40d442d244ab296083fd3df582d8c
64 N4cea4a68d5c045faa70ef75312b1b97b schema:familyName Bachem
65 schema:givenName Achim
66 rdf:type schema:Person
67 N9b88385ea68c4b06946bb412246d3bda rdf:first sg:person.014335443074.50
68 rdf:rest Nb22e9a21b89a4f14816ccc53e4d332f4
69 Na1d40d442d244ab296083fd3df582d8c rdf:first N02925cbd746e40a09fc04a1906aa2347
70 rdf:rest rdf:nil
71 Nb22e9a21b89a4f14816ccc53e4d332f4 rdf:first sg:person.010114327577.61
72 rdf:rest rdf:nil
73 Nb66c05f7c72a4659a6511ffa0216bc45 schema:name doi
74 schema:value 10.1007/978-3-642-46955-8_114
75 rdf:type schema:PropertyValue
76 Nc2c8f3fc2b4d4dc78261127646502d88 rdf:first Ndc1f1c9b77624713ad42a0a6c814554a
77 rdf:rest N3823b132b9c743b8b03d514deb35f79d
78 Nca7f6bf871834a3eaf347acee65da9eb schema:isbn 978-3-642-46955-8
79 978-3-7908-0794-3
80 schema:name Operations Research ’93
81 rdf:type schema:Book
82 Ndc1f1c9b77624713ad42a0a6c814554a schema:familyName Derigs
83 schema:givenName Ulrich
84 rdf:type schema:Person
85 Ne1cc855a61f04ccaa0d4596341c59f64 schema:familyName Jünger
86 schema:givenName Michael
87 rdf:type schema:Person
88 Nf8b0e633216042468ace44e80e58cf9f rdf:first N4cea4a68d5c045faa70ef75312b1b97b
89 rdf:rest Nc2c8f3fc2b4d4dc78261127646502d88
90 Nfb652ea303c843de99f1cb737ec0ec76 schema:name Springer Nature
91 rdf:type schema:Organisation
92 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
93 schema:name Information and Computing Sciences
94 rdf:type schema:DefinedTerm
95 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
96 schema:name Computation Theory and Mathematics
97 rdf:type schema:DefinedTerm
98 sg:person.010114327577.61 schema:affiliation grid-institutes:grid.10392.39
99 schema:familyName Argenton
100 schema:givenName Hans
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010114327577.61
102 rdf:type schema:Person
103 sg:person.014335443074.50 schema:affiliation grid-institutes:grid.10392.39
104 schema:familyName Seipel
105 schema:givenName Dietmar
106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014335443074.50
107 rdf:type schema:Person
108 grid-institutes:grid.10392.39 schema:alternateName University of Tübingen Sand 13, D - 72076, Tübingen, Germany
109 schema:name University of Tübingen Sand 13, D - 72076, Tübingen, Germany
110 rdf:type schema:Organization
 




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


...