The complexity of nested counterfactuals and iterated knowledge base revisions
- Author
- EITER, T1 ; GOTTLOB, G1
[1] Christian Doppler Laboratory for Expert Systems, Information Systems Department, Technical University of Vienna, Paniglgasse 16, 1040 Wien, Austria - Conference title
- 1994 ACM Symposium on Parallel Algorithms and Architectures
- Conference name
- 1994 ACM Symposium on Parallel Algorithms and Architectures (Cape May, New Jersey 1994-06-27)
- Author (monograph)
- BLELLOCH, Guy E (Editor); LEISERSON, Charles E (Editor); PLAXTON, C. Gregory (Editor)
Association for Computing Machinery, New York NY, United States (Funder/Sponsor) - Source
Journal of computer and system sciences (Print). 1996, Vol 53, Num 3, pp 497-512 ; ref : 37 ref
- CODEN
- JCSSBM
- ISSN
- 0022-0000
- Scientific domain
- Control theory, operational research; Computer science
- Publisher
- Academic Press, Brugge
- Publication country
- Belgium
- Document type
- Conference Paper
- Language
- English
- Keyword (fr)
- Algorithme Algorithmique Base connaissance Circonscription Complexité calcul Démonstration automatique Démonstration théorème Modélisation Nested counterfactuals
- Keyword (en)
- Algorithm Algorithmics Knowledge base Circumscription Computational complexity Automatic proving Theorem proving Modeling
- Keyword (es)
- Algoritmo Algorítmica Base conocimiento Circonscripción Complejidad computación Demostración automática Demostración teorema Modelización
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02C Artificial intelligence / 001D02C03 Pattern recognition. Digital image processing. Computational geometry
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 2563498
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1006/jcss.1996.0083 
https://dx.doi.org/10.1006/jcss.1996.0083
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jcss.1996.0083\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:78:\"The complexity of nested counterfactuals and iterated knowledge base revisions\";s:9:\"\u0000*\u0000jtitle\";s:47:\"Journal of computer and system sciences (Print)\";s:9:\"\u0000*\u0000stitle\";s:29:\"J. comput. syst. sci. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"53\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"497\";s:8:\"\u0000*\u0000epage\";s:3:\"512\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0022-0000\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"EITER\";s:10:\"\u0000*\u0000aufirst\";s:1:\"T\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"GOTTLOB, G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JCSSBM\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:59:\"1994 ACM Symposium on Parallel Algorithms and Architectures\";s:8:\"\u0000*\u0000title\";s:78:\"The complexity of nested counterfactuals and iterated knowledge base revisions\";s:8:\"\u0000*\u0000place\";s:6:\"Brugge\";s:6:\"\u0000*\u0000pub\";s:14:\"Academic Press\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jcss.1996.0083\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:78:\"The complexity of nested counterfactuals and iterated knowledge base revisions\";s:9:\"\u0000*\u0000jtitle\";s:47:\"Journal of computer and system sciences (Print)\";s:9:\"\u0000*\u0000stitle\";s:29:\"J. comput. syst. sci. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"53\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"497\";s:8:\"\u0000*\u0000epage\";s:3:\"512\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0022-0000\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"EITER\";s:10:\"\u0000*\u0000aufirst\";s:1:\"T\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"GOTTLOB, G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JCSSBM\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:59:\"1994 ACM Symposium on Parallel Algorithms and Architectures\";s:8:\"\u0000*\u0000title\";s:78:\"The complexity of nested counterfactuals and iterated knowledge base revisions\";s:8:\"\u0000*\u0000place\";s:6:\"Brugge\";s:6:\"\u0000*\u0000pub\";s:14:\"Academic Press\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jcss.1996.0083\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jcss.1996.0083\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:78:\"The complexity of nested counterfactuals and iterated knowledge base revisions\";s:9:\"\u0000*\u0000jtitle\";s:47:\"Journal of computer and system sciences (Print)\";s:9:\"\u0000*\u0000stitle\";s:29:\"J. comput. syst. sci. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"53\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"497\";s:8:\"\u0000*\u0000epage\";s:3:\"512\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0022-0000\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"EITER\";s:10:\"\u0000*\u0000aufirst\";s:1:\"T\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"GOTTLOB, G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JCSSBM\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:59:\"1994 ACM Symposium on Parallel Algorithms and Architectures\";s:8:\"\u0000*\u0000title\";s:78:\"The complexity of nested counterfactuals and iterated knowledge base revisions\";s:8:\"\u0000*\u0000place\";s:6:\"Brugge\";s:6:\"\u0000*\u0000pub\";s:14:\"Academic Press\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jcss.1996.0083\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:78:\"The complexity of nested counterfactuals and iterated knowledge base revisions\";s:9:\"\u0000*\u0000jtitle\";s:47:\"Journal of computer and system sciences (Print)\";s:9:\"\u0000*\u0000stitle\";s:29:\"J. comput. syst. sci. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"53\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"497\";s:8:\"\u0000*\u0000epage\";s:3:\"512\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0022-0000\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"EITER\";s:10:\"\u0000*\u0000aufirst\";s:1:\"T\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"GOTTLOB, G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JCSSBM\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:59:\"1994 ACM Symposium on Parallel Algorithms and Architectures\";s:8:\"\u0000*\u0000title\";s:78:\"The complexity of nested counterfactuals and iterated knowledge base revisions\";s:8:\"\u0000*\u0000place\";s:6:\"Brugge\";s:6:\"\u0000*\u0000pub\";s:14:\"Academic Press\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:22:\"10.1006\/jcss.1996.0083\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:78:\"The complexity of nested counterfactuals and iterated knowledge base revisions\";s:9:\"\u0000*\u0000jtitle\";s:47:\"Journal of computer and system sciences (Print)\";s:9:\"\u0000*\u0000stitle\";s:29:\"J. comput. syst. sci. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"1996\";s:9:\"\u0000*\u0000volume\";s:2:\"53\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"497\";s:8:\"\u0000*\u0000epage\";s:3:\"512\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0022-0000\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"EITER\";s:10:\"\u0000*\u0000aufirst\";s:1:\"T\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"GOTTLOB, G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JCSSBM\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:59:\"1994 ACM Symposium on Parallel Algorithms and Architectures\";s:8:\"\u0000*\u0000title\";s:78:\"The complexity of nested counterfactuals and iterated knowledge base revisions\";s:8:\"\u0000*\u0000place\";s:6:\"Brugge\";s:6:\"\u0000*\u0000pub\";s:14:\"Academic Press\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
