Petr Stepánek - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2020

Smart City Through Design: Preparation of a New Wayfinding System in PraguePetr Stepánek. hci 2020: 514-526 [doi]

2019

Towards a systems thinking based view for the governance of a smart city's ecosystemFrancesco Caputo, Leonard Walletzký, Petr Stepánek. kybernetes, 48(1):108-123, 2019. [doi]

2018

Validation and Extension of the Smart City OntologyPetr Stepánek, Mouzhi Ge. ICEIS 2018: 406-413 [doi]

2017

IT-Enabled Digital Service Design Principles - Lessons Learned from Digital CitiesPetr Stepánek, Mouzhi Ge, Leonard Walletzký. emcis 2017: 186-196 [doi]

2015

Origin-independent sum over states simulations of magnetic and electronic circular dichroism spectra via the localized orbital/local origin methodPetr Stepánek, Petr Bour. jcc, 36(10):723-730, 2015. [doi]

2013

Computation of magnetic circular dichroism by sum-over-states summationsPetr Stepánek, Petr Bour. jcc, 34(18):1531-1539, 2013. [doi]

2012

Nonmonotonic Reasoning in Description Logic by Tableaux Algorithm with BlockingJaromir Malenko, Petr Stepánek. dlog 2012: [doi]

2011

MaLeCoP Machine Learning Connection ProverJosef Urban, Jirí Vyskocil, Petr Stepánek. tableaux 2011: 263-277 [doi]

2007

Improving Efficiency of Prolog Programs by Fully Automated Unfold/Fold TransformationJirí Vyskocil, Petr Stepánek. micai 2007: 305-315 [doi]

2004

Speedup of Logic Programs by Binarization and Partial DeductionJan Hruza, Petr Stepánek. tplp, 4(3):355-380, 2004.

2002

Schema-Based Transformations of Logic Programs in lambda-PrologPetr Olmer, Petr Stepánek. ICLP 2002: 472 [doi]

2000

Binary Speed Up for Logic ProgramsJan Hruza, Petr Stepánek. cl 2000: 116-130 [doi]

1997

Extendible meta-interpretersRoman Barták, Petr Stepánek. kybernetika, 33(3):291-310, 1997. [doi]

1992

Prolog: A Step towards the Future of ProgrammingOlga Stepánková, Petr Stepánek. ac 1992: 50-81

1989

AI Education and LogicOlga Stepánková, Petr Stepánek. cepes 1990: 199-205

Stratification of Definite Clause Programs and of General Logic ProgramsOlga Stepánková, Petr Stepánek. csl 1990: 396-408

1988

Normal Forms and the Complexity of Computations of Logic ProgramsVít Ochozka, Olga Stepánková, Petr Stepánek. csl 1989: 357-371

1987

Developing Logic Programs: Computing Through NormalizingOlga Stepánková, Petr Stepánek. csl 1988: 304-321

1986

Logic Programs and AlternationPetr Stepánek, Olga Stepánková. ICLP 1986: 99-106

1984

Transformations of Logic ProgramsOlga Stepánková, Petr Stepánek. jlp, 1(4):305-318, 1984.

Computation Trees and Transformations of Logic ProgramsOlga Stepánková, Petr Stepánek. ICLP 1984: 53-63

1982

Graphs as Data in Prolog ProgramsJan Sebelík, Petr Stepánek. ICLP 1982: 105-109

1978

Cardinal Collapsing and Ordinal DefinabilityPetr Stepánek. JSYML, 43(4):635-642, 1978.

1977

Embedding Theorems for Boolean Algebras and Consistency Results on Ordinal Definable SetsPetr Stepánek, Bohuslav Balcar. JSYML, 42(1):64-76, 1977.

Sign in or sign up to see more results.

runs on WebDSL