Result 1 to 20 from 59 total
Finite-valued logics for information processing. (English)
Fundam. Inform. 114, No. 1, 1-30 (2012).
1
Logics of reasonable information sources (English)
ISMVL, 61-66 (2010).
2
A four-valued logic for reasoning about finite and infinite computation errors in programs. (English)
Carnielli, Walter (ed.) et al., The many sides of logic. Selected papers of the simultaneous conferences “CLE 30 ‒ 30th Anniversary of the Centre for Logic, Epistemology and the History of Science", “XV EBL ‒ 15th Brazilian Logic Conference" and “XIV SLALM ‒ 14th Latin-American Symposium on Mathematical Logic", Paraty, Brazil, May 11‒17, 2008. London: College Publications (ISBN 978-1-904987-78-9/pbk). Studies in Logic (London) 21, 403-423 (2009).
3
Proof systems for reasoning about computation errors. (English)
Stud. Log. 91, No. 2, 273-293 (2009).
4
Processing information from a set of sources. (English)
Makinson, David (ed.) et al., Towards mathematical philosophy. Papers from the Studia Logica conference Trends in Logic IV, Toruń, Poland, September 1‒4, 2006. Berlin: Springer (ISBN 978-1-4020-9083-7/hbk; 978-1-4020-9084-4/e-book). Trends in Logic‒Studia Logica Library 28, 165-186 (2009).
5
Rough sets and 3-valued logics. (English)
Stud. Log. 90, No. 1, 69-92 (2008).
6
Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics. (English)
Log. Univers. 1, No. 1, 41-70 (2007).
7
A multi-modal logic for disagreement and exhaustiveness. (English)
Fundam. Inform. 75, No. 1-4, 215-238 (2007).
8
Model checking for multivalued logic of knowledge and time (English)
AAMAS, 169-176 (2006).
9
A decompositional deduction system for a logic featuring inconsistency and uncertainty. (English)
J. Appl. Non-Class. Log. 15, No. 1, 25-44 (2005).
10
Multi-valued calculi for logics based on non-determinism. (English)
Log. J. IGPL 13, No. 4, 365-387 (2005).
11
On designated values in multi-valued $\text{CTL}^*$ model checking. (English)
Fundam. Inform. 60, No. 1-4, 211-224 (2004).
12
Model checking for multi-valued computation tree logics. (English)
Fitting, Melvin (ed.) et al., Beyond two: Theory and applications of multiple-valued logic. Heidelberg: Physica-Verlag (ISBN 3-7908-1541-1/pbk). Stud. Fuzziness Soft Comput. 114, 193-210 (2003).
13
Reducing model checking from multi-valued $\text{CTL}^{\ast}$ to $\text{CTL}^{\ast}$. (English)
Brim, Luboš (ed.) et al., CONCUR 2002 - concurrency theory. 13th international conference, Brno, Czech Republic, August 20-23, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2421, 226-239 (2002).
14
Rasiowa-Sikorski deduction systems in computer science applications. (English)
Theor. Comput. Sci. 286, No. 2, 323-366 (2002).
15
Reducing model checking from multi-valued {$\rm $CTL}^{\ast} to {$\rm $CTL}^{\ast} (English)
CONCUR, 226-239 (2002).
16
A relational formalisation of a generic many-valued modal logic. (English)
Orłowska, Ewa (ed.) et al., Relational methods for computer science applications. Heidelberg: Physica-Verlag. Stud. Fuzziness Soft Comput. 65, 183-202 (2001).
17
Decomposition proof systems for Gödel-Dummett logics. (English)
Stud. Log. 69, No.2, 197-219 (2001).
18
A multimodal logic for reasoning about complementarity. (English)
J. Appl. Non-Class. Log. 10, No. 3-4, 273-301 (2000).
19
Rasiowa-Sikorski deduction systems: A handy tool for computer science logics. (English)
Fiadeiro, José Luiz (ed.), Recent trends in algebraic development techniques. 13th international workshop, WADT ’98, Lisbon, Portugal, April 2-4, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1589, 183-197 (1999).
20
Result 1 to 20 from 59 total
Start
Contact
Print
General Help
