Computational properties of argument systems satisfying graph-theoretic constraints

Artificial Intelligence 171 (10-15):701-729 (2007)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,503

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Graph-theoretic Models of Dispositional Structures.Matthew Tugby - 2013 - International Studies in the Philosophy of Science 27 (1):23-39.
On graph-theoretic fibring of logics.A. Sernadas, C. Sernadas, J. Rasga & M. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1321-1357.
A logician's view of graph polynomials.J. A. Makowsky, E. V. Ravve & T. Kotek - 2019 - Annals of Pure and Applied Logic 170 (9):1030-1069.
Free set algebras satisfying systems of equations.G. Aldo Antonelli - 1999 - Journal of Symbolic Logic 64 (4):1656-1674.
A graph-theoretic account of logics.A. Sernadas, C. Sernadas, J. Rasga & Marcelo E. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1281-1320.
Free Set Algebras Satisfying Systems of Equations.G. Antonelli - 1999 - Journal of Symbolic Logic 64 (4):1656-1674.
Relating Categorical and Kripke Semantics for Intuitionistic Modal Logics.Natasha Alechina, Valeria de Paiva & Eike Ritter - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 35-52.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,378,468)

6 months
4 (#779,417)

Historical graph of downloads
How can I increase my downloads?