Implementation and manipulation of formal objects: an object-oriented view
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
A formal basis for schema analysis of semantic database update semantics
CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science
A complete axiomatization of process temporal logic
Fundamenta Informaticae
Proving nets correct via cause-effect structures (an experiment)
Fundamenta Informaticae - Concurrency specification and programming
Undecidability of a multi-agent logic
Fundamenta Informaticae - Concurrency specification and programming
A Strong Completeness Result for a MAS Logic
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
A Propositional Dynamic Logic Approach for Order of Magnitude Reasoning
IBERAMIA '08 Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence
Algorithmic Logic + SpecVer = the Methodology for High Integrity Programming − Invited Paper
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A Logic for Reasoning about Persuasion
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Modeling Persuasiveness: change of uncertainty through agents' interactions
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Verifying a Class: combining Testing and Proving
Fundamenta Informaticae
Magnitude qualitative reasoning via PDL
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Verifying a Class: combining Testing and Proving
Fundamenta Informaticae
Algorithmic Logic + SpecVer = the Methodology for High Integrity Programming − Invited Paper
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A Logic for Reasoning about Persuasion
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A Strong Completeness Result for a MAS Logic
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Proving Nets Correct via Cause-Effect Structures (An Experiment)
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Undecidability of a Multi-Agent Logic
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
A Complete Axiomatization of Process Temporal Logic
Fundamenta Informaticae
AXIOMATIZATIONS OF TEMPORAL LOGICS ON TRACE SYSTEMS
Fundamenta Informaticae
ON NATURAL DEDUCTION IN FIRST-ORDER FIXPOINT LOGICS
Fundamenta Informaticae
The Algebraic Specifications do not have the Tennenbaum Property
Fundamenta Informaticae
Hi-index | 0.00 |