๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

SCC-recursiveness: a general schema for argumentation semantics

โœ Scribed by Pietro Baroni; Massimiliano Giacomin; Giovanni Guida

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
369 KB
Volume
168
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A game semantics for generic polymorphis
A game semantics for generic polymorphism
โœ Samson Abramsky; Radha Jagadeesan ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 360 KB
Completeness, decidability and complexit
Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary
โœ Herman J. ter Horst ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 496 KB

We prove that entailment for RDF Schema (RDFS) is decidable, NP-complete, and in P if the target graph does not contain blank nodes. We show that the standard set of entailment rules for RDFS is incomplete and that this can be corrected by allowing blank nodes in predicate position. We define seman