Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Autor
- TRUSZCZYNSKI, Miroslaw1
[1] Department of Computer Science, University of Kentucky, Lexington, KY 40506, United States - Fuente
Artificial intelligence (General ed.). 2010, Vol 174, Num 16-17, pp 1285-1306, 22 p ; ref : 32 ref
- CODEN
- AINTBB
- ISSN
- 0004-3702
- Campo Científico
- Cognition; Computer science
- Editor
- Elsevier, Oxford
- País de la publicación
- United Kingdom
- Tipo de documento
- Article
- Idioma
- English
- Palabra clave de autor
- Logic HT Logic programming Reducts Stable models Supported models
- Palabra clave (fr)
- Forme normale Langage propositionnel Logique propositionnelle Modélisation Programmation logique Représentation connaissance Sémantique des modèles stables
- Palabra clave (in)
- Normal form Propositional language Propositional logic Modeling Logical programming Knowledge representation Stable-model semantics
- Palabra clave (es)
- Forma normal Lenguaje proposiciónal Lógica proposicional Modelización Programación lógica Representación conocimientos Semántica de modelos Stables
- Clasificación
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A04 Logical, boolean and switching functions
- Disciplina
- Computer science : theoretical automation and systems
- Procedencia
- Inist-CNRS
- Base de datos
- PASCAL
- Identificador INIST
- 23297593
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
Acceso al documento
Install on your browser
DOI
10.1016/j.artint.2010.08.004 
https://dx.doi.org/10.1016/j.artint.2010.08.004
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2010.08.004\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:111:\"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Artificial intelligence (General ed.)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Artif. intell. (Gen. ed.)\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"174\";s:8:\"\u0000*\u0000issue\";s:5:\"16-17\";s:8:\"\u0000*\u0000spage\";s:4:\"1285\";s:8:\"\u0000*\u0000epage\";s:4:\"1306\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:12:\"TRUSZCZYNSKI\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Miroslaw\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:111:\"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"22\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante Panist
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2010.08.004\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:111:\"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Artificial intelligence (General ed.)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Artif. intell. (Gen. ed.)\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"174\";s:8:\"\u0000*\u0000issue\";s:5:\"16-17\";s:8:\"\u0000*\u0000spage\";s:4:\"1285\";s:8:\"\u0000*\u0000epage\";s:4:\"1306\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:12:\"TRUSZCZYNSKI\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Miroslaw\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:111:\"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"22\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante Istex
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2010.08.004\";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;}"
Acceso mediante Unpaywall
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2010.08.004\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:111:\"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Artificial intelligence (General ed.)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Artif. intell. (Gen. ed.)\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"174\";s:8:\"\u0000*\u0000issue\";s:5:\"16-17\";s:8:\"\u0000*\u0000spage\";s:4:\"1285\";s:8:\"\u0000*\u0000epage\";s:4:\"1306\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:12:\"TRUSZCZYNSKI\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Miroslaw\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:111:\"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"22\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante Europe PubMed Central
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2010.08.004\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:111:\"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Artificial intelligence (General ed.)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Artif. intell. (Gen. ed.)\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"174\";s:8:\"\u0000*\u0000issue\";s:5:\"16-17\";s:8:\"\u0000*\u0000spage\";s:4:\"1285\";s:8:\"\u0000*\u0000epage\";s:4:\"1306\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:12:\"TRUSZCZYNSKI\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Miroslaw\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:111:\"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"22\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante Base Search
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2010.08.004\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:111:\"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs\";s:9:\"\u0000*\u0000jtitle\";s:37:\"Artificial intelligence (General ed.)\";s:9:\"\u0000*\u0000stitle\";s:25:\"Artif. intell. (Gen. ed.)\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"174\";s:8:\"\u0000*\u0000issue\";s:5:\"16-17\";s:8:\"\u0000*\u0000spage\";s:4:\"1285\";s:8:\"\u0000*\u0000epage\";s:4:\"1306\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:12:\"TRUSZCZYNSKI\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Miroslaw\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:111:\"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"22\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Acceso mediante arXiv
