#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2002

2017

- This year (6)
- Last 5 years (33)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Adam Grabowski, Artur Kornilowicz, Adam Naumowicz
- J. Formalized Reasoning
- 2010

This report has been submitted forr publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report forr early dissemination of its contents. In view of the transfert of copy right too the outside publisher, its distribution outside of ITC priorr to publication should be limited to peer… (More)

Enormous progress has been achieved in the last decade in the verification of timed systems, making it possible to analyze significant real-world protocols. An open challenge is the identification of fully symbolic verification techniques, able to deal effectively with the finite state component as well as with the timing aspects. In this paper we propose a… (More)

- Adam Grabowski, Artur Kornilowicz, Adam Naumowicz
- Journal of Automated Reasoning
- 2015

This special issue is dedicated to works related to Mizar, the theorem proving project started by Andrzej Trybulec in the 1970s, and other automated proof checking systems used for formalizing mathematics.

- Adam Naumowicz, Artur Kornilowicz
- TPHOLs
- 2009

- Grzegorz Bancerek, Czeslaw Bylinski, +5 authors Josef Urban
- CICM
- 2015

- Andrzej Trybulec, Artur Kornilowicz, Adam Naumowicz, Krystyna Trybulec Kuperberg
- Journal of Automated Reasoning
- 2012

The collection of works for this special issue was inspired by the presentations given at the 2011 AMS Special Session on Formal Mathematics for Mathematicians: Developing Large Repositories of Advanced Mathematics. The issue features a collection of articles by practitioners of formalizing proofs who share a deep interest in making computerized mathematics… (More)

- Artur Kornilowicz
- Formalized Mathematics
- 2009

In this paper x, X, X1, X2 are sets. Let Y be a functional set. The functor DOMS(Y ) is defined by: (Def. 1) DOMS(Y ) = ⋃ {dom f : f ranges over elements of Y }. Let us consider X. We say that X is complex-functions-membered if and only if: (Def. 2) If x ∈ X, then x is a complex-valued function. Let us consider X. We say that X is… (More)

In the last years we have witnessed an impressive advance in the efficiency of boolean solving techniques, which has brought large previously intractable problems at the reach of state-of-the-art solvers. Unfortunately, simple boolean expressions are not expressive enough for representing many real-world problems, which require handling also integer or real… (More)

- Artur Kornilowicz
- Journal of Automated Reasoning
- 2012

This paper presents some tentative experiments in using a special case of rewriting rules in Mizar (Mizar homepage: http://www.mizar.org/ ): rewriting a term as its subterm. A similar technique, but based on another Mizar mechanism called functor identification (Korniłowicz 2009) was used by Caminati, in his paper on basic first-order model theory in Mizar… (More)