http://www.cnr.it/ontology/cnr/individuo/prodotto/ID91356
Query answering under the any-world assumption for normal logic programs (Contributo in atti di convegno)
- Type
- Label
- Query answering under the any-world assumption for normal logic programs (Contributo in atti di convegno) (literal)
- Anno
- 2006-01-01T00:00:00+01:00 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Straccia Umberto (literal)
- Pagina inizio
- Pagina fine
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
- http://www.aaai.org/Papers/KR/2006/KR06-035.pdf (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume
- Proceedings of the International Conference on Principles of Knowledge Representation (KR-06) (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
- In: International Conference on Principles of Knowledge Representation (KR-06) (Lake District, 2-5 June 2006). Proceedings, pp. 329-339. AAAI Press, 2006. (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
- ABSTRACT: Recently, Loyer and Straccia have defined the Any-World Assumption (AWA) for normal logic programs as a generalization of the well-known notions of Closed World Assumption (CWA) and the Open World Assumption (OWA). The AWA allows any assignment (i.e. interpretation), over a truth space (bilattice), to be a default assumption and, thus, the CWA and OWA are just special cases. While a declarative and a fixed-point characterization for normal logic programs under the AWA has been given, the topic of this paper is to provide a simple, yet general top-down query answering procedure for this setting. (literal)
- Note
- ISI Web of Science (WOS) (literal)
- Google Scholar (literal)
- DBLP (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
- Titolo
- Query answering under the any-world assumption for normal logic programs (literal)
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
- 978-1-57735-271-6 (literal)
- Abstract
- Recently, Loyer and Straccia have defined the Any-World Assumption (AWA) for normal logic programs as a generalization of the well-known notions of Closed World Assumption (CWA) and the Open World Assumption (OWA). The AWA allows any assignment (i.e. interpretation), over a truth space (bilattice), to be a default assumption and, thus, the CWA and OWA are just special cases. While a declarative and a fixed-point characterization for normal logic programs under the AWA has been given, the topic of this paper is to provide a simple, yet general top-down query answering procedure for this setting. (literal)
- Prodotto di
- Autore CNR
- Insieme di parole chiave
Incoming links:
- Autore CNR di
- Prodotto
- Insieme di parole chiave di