Sage Journals: Discover world-class research

Retricted access

Research article

First published 2002-3

A Complete Axiomatization of Process Temporal Logic

Magdalena Kacprzak

Fundamenta Informaticae

Retricted access

Research article

First published 2016-4

Lattice and metric completions of the classical logic metric space and a comparison 1

Hui-Xian Shi, Yong-Ming Li

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

Retricted access

Research article

First published 2001-3

Complexity of Fuzzy Probability Logics

Petr Hájek, Sauro Tulipani

Fundamenta Informaticae

Retricted access

Research article

First published 2006-8

A Strong Completeness Result for a MAS Logic

Magdalena Kacprzak

Fundamenta Informaticae

Retricted access

Research article

First published 2007-1

Complexity Issues in Multiagent Logics

Marcin Dziubiński, Rineke Verbrugge, Barbara Dunin-K�plicz

Fundamenta Informaticae

Retricted access

Research article

First published 2007-1

Relative Nondeterministic Information Logic is EXPTIME-complete

Stéphane Demri, Ewa Orłowska

Fundamenta Informaticae

Retricted access

Research article

First published 2000-7

The Nondeterministic Information Logic NIL is PSPACE-complete

Stéphane Demri

Fundamenta Informaticae

Retricted access

Research article

First published 1994-12

COMPLETENESS AND SOUNDNESS OF AXIOMATIZATIONS FOR TEMPORAL LOGICS WITHOUT NEXT

L.E. Moser, P.M. Melliar-Smith, G. Kutty [...]

Fundamenta Informaticae

Retricted access

Research article

First published 1990

Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions

V.S. Subrahmanian

Fundamenta Informaticae

Retricted access

Research article

First published 2000-12

Computational Complexity of Multimodal Logics \newline Based on Rough Sets

Stéphane Demri, Jarosław Stepaniuk

Fundamenta Informaticae

Search results