| dc.contributor.author | Dimopoulos, Yannis | en |
| dc.contributor.author | Magirou, V. | en |
| dc.creator | Dimopoulos, Yannis | en |
| dc.creator | Magirou, V. | en |
| dc.date.accessioned | 2019-11-13T10:39:54Z | |
| dc.date.available | 2019-11-13T10:39:54Z | |
| dc.date.issued | 1994 | |
| dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/53864 | |
| dc.description.abstract | A network representation of propositional seminormal disjunction-free default theories is presented, leading to a graph-theoretic approach to their analysis. The problem of finding an extension is proved to be equivalent to that of determining a kernel for a corresponding graph, allowing stronger complexity results as well as new conditions for the existence of extensions. © 1994 Academic Press, Inc. | en |
| dc.source | Information and Computation | en |
| dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0013026117&doi=10.1006%2finco.1994.1058&partnerID=40&md5=b4b5263bbb14b7064b623feba143c53e | |
| dc.title | A Graph-Theoretic Approach to Default Logic | en |
| dc.type | info:eu-repo/semantics/article | |
| dc.identifier.doi | 10.1006/inco.1994.1058 | |
| dc.description.volume | 112 | |
| dc.description.issue | 2 | |
| dc.description.startingpage | 239 | |
| dc.description.endingpage | 256 | |
| dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
| dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
| dc.type.uhtype | Article | en |
| dc.description.notes | <p>Cited By :19</p> | en |
| dc.source.abbreviation | Inf Comput | en |
| dc.contributor.orcid | Dimopoulos, Yannis [0000-0001-9583-9754] | |
| dc.gnosis.orcid | 0000-0001-9583-9754 | |
