Logic of Infons: the Propositional Case (English)
- New search for: Gurevich, Y.
- New search for: Neeman, I.
- New search for: Gurevich, Y.
- New search for: Neeman, I.
In:
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
;
12
, 2
;
Article 9
;
2011
-
ISSN:
- Article (Journal) / Print
-
Title:Logic of Infons: the Propositional Case
-
Contributors:Gurevich, Y. ( author ) / Neeman, I. ( author )
-
Published in:ACM TRANSACTIONS ON COMPUTATIONAL LOGIC ; 12, 2 ; Article 9
-
Publisher:
- New search for: Association for Computing Machinery
-
Publication date:2011-01-01
-
Size:Article 9
-
ISSN:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 004.015113
- Further information on Dewey Decimal Classification
-
Classification:
DDC: 004.015113 -
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents – Volume 12, Issue 2
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
-
Annotated Probabilistic Temporal LogicShakarian, P. / Parker, A. / Simari, G. / Subrahmanian, V.S. et al. | 2011
-
Article 16 (43 pages) - Persistent Queries in the Behavioral Theory of AlgorithmsBlass, A et al. | 2011
-
Logic of Infons: the Propositional CaseGurevich, Y. / Neeman, I. et al. | 2011
-
Persistent Queries in the Behavioral Theory of AlgorithmsBlass, A. / Gurevich, Y. et al. | 2011
-
Article 11 (41 pages) - Well-Founded Semantics for Description Logic Programs in the Semantic WebEiter, T et al. | 2011
-
Article 12 (21 pages) - Monadic Second Order Logic on Graphs with Local Cardinality ConstraintsSzeider, S et al. | 2011
-
Article 14 (44 pages) - Annotated Probabilistic Temporal LogicShakarian, P et al. | 2011
-
Monadic Second Order Logic on Graphs with Local Cardinality ConstraintsSzeider, S. et al. | 2011
-
The Tractability of Model Checking for LTL: The Good, the Bad, and the Ugly FragmentsBauland, M. / Mundhenk, M. / Schneider, T. / Schnoor, H. / Schnoor, I. / Vollmer, H. et al. | 2011
-
Mechanizing the Metatheory of LFUrban, C. / Cheney, J. / Berghofer, S. et al. | 2011
-
Article 15 (42 pages) - Mechanizing the Metatheory of LFUrban, C et al. | 2011
-
Article 17 (46 pages) - MWeb: A Principled Framework for Modular Web Rule Bases and its SemanticsAnalyti, A et al. | 2011
-
Article 13 (28 pages) - The Tractability of Model Checking for LTL: The Good, the Bad, and the Ugly FragmentsBauland, M et al. | 2011
-
Article 10 (24 pages) - Safety Alternating Automata on Data WordsLazic, R et al. | 2011
-
Well-Founded Semantics for Description Logic Programs in the Semantic WebEiter, T. / Ianni, G. / Lukasiewicz, T. / Schindlauer, R. et al. | 2011
-
MWeb: A Principled Framework for Modular Web Rule Bases and its SemanticsAnalyti, A. / Antoniou, G. / Damasio, C.V. et al. | 2011
-
Safety Alternating Automata on Data WordsLazic, R. et al. | 2011
-
Article 9 (28 pages) - Logic of Infons: The Propositional CaseGurevich, Y et al. | 2011