Matches in DBpedia 2015-10 for { <http://doi.org/10.1016/S0022-0000(05)80004-2> ?p ?o }
Showing triples 1 to 18 of
18
with 100 triples per page.
- S0022-0000(05)80004-2 accessdate "2013-02-20".
- S0022-0000(05)80004-2 date "April 1994".
- S0022-0000(05)80004-2 doi "10.1016/S0022-000080004-2".
- S0022-0000(05)80004-2 first1 "M.".
- S0022-0000(05)80004-2 first1 "Marco".
- S0022-0000(05)80004-2 first2 "M.".
- S0022-0000(05)80004-2 first2 "Maurizio".
- S0022-0000(05)80004-2 isCitedBy Circumscription_(logic).
- S0022-0000(05)80004-2 isCitedBy Closed-world_assumption.
- S0022-0000(05)80004-2 issn "0022-0000".
- S0022-0000(05)80004-2 issue "2".
- S0022-0000(05)80004-2 journal "Journal of Computer and System Sciences".
- S0022-0000(05)80004-2 last1 "Cadoli".
- S0022-0000(05)80004-2 last2 "Lenzerini".
- S0022-0000(05)80004-2 pages "255–310".
- S0022-0000(05)80004-2 title "The complexity of propositional closed world reasoning and circumscription".
- S0022-0000(05)80004-2 url S0022000005800042.
- S0022-0000(05)80004-2 volume "48".