1994
AUTHORSDietmar Seipel , Hans Argenton
ABSTRACTNon—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... »
PAGES458-462
Operations Research ’93
ISBN
978-3-7908-0794-3
978-3-642-46955-8
http://scigraph.springernature.com/pub.10.1007/978-3-642-46955-8_114
DOIhttp://dx.doi.org/10.1007/978-3-642-46955-8_114
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1032470886
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
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