default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFeliks Kluzniak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Neda Saeedloei, Feliks Kluzniak:
Synthesizing Timed Automata with Minimal Numbers of Clocks from Optimised Timed Scenarios. FORTE 2024: 136-154- 2023
- [c16]Neda Saeedloei, Feliks Kluzniak:
Operations on Timed Scenarios. FORTE 2023: 97-114 - 2022
- [c15]Neda Saeedloei, Feliks Kluzniak:
Untangling the Graphs of Timed Automata to Decrease the Number of Clocks. IFM 2022: 168-187 - [c14]Neda Saeedloei, Feliks Kluzniak:
An Efficient Customized Clock Allocation Algorithm for a Class of Timed Automata. SBMF 2022: 3-21 - 2021
- [c13]Neda Saeedloei, Feliks Kluzniak:
Minimization of the Number of Clocks for Timed Scenarios. SBMF 2021: 122-139 - 2020
- [c12]Neda Saeedloei, Feliks Kluzniak:
Synthesizing Clock-Efficient Timed Automata. IFM 2020: 276-294 - [c11]Neda Saeedloei, Feliks Kluzniak:
Optimization of Timed Scenarios. SBMF 2020: 119-136
2010 – 2019
- 2018
- [c10]Neda Saeedloei, Feliks Kluzniak:
Clock Allocation in Timed Automata and Graph Colouring. HSCC 2018: 71-80 - [c9]Neda Saeedloei, Feliks Kluzniak:
Timed Scenarios: Consistency, Equivalence and Optimization. SBMF 2018: 215-233 - 2017
- [c8]Neda Saeedloei, Feliks Kluzniak:
From Scenarios to Timed Automata. SBMF 2017: 33-51 - 2011
- [c7]Gopal Gupta, Neda Saeedloei, Brian W. DeVries, Richard Min, Kyle Marple, Feliks Kluzniak:
Infinite Computation, Co-induction and Computational Logic. CALCO 2011: 40-54
1990 – 1999
- 1997
- [j1]Feliks Kluzniak, Miroslawa Milkowska:
Spill - A Logic Language for Writing Testable Requirements Specifications. Sci. Comput. Program. 28(2-3): 193-223 (1997) - 1994
- [c6]Feliks Kluzniak, Miroslawa Milkowska:
Executable requirements Specifications in a Logic Specification Language SPILL-2. ICLP Workshop: Applications of Logic Programming to Software Engineering 1994 - [c5]Feliks Kluzniak, Miroslawa Milkowska:
Readable, Runnable Requirements Specifications in SPILL-2. PLILP 1994: 449-450 - 1991
- [c4]Andreas Kågedal, Feliks Kluzniak:
Enriching Prolog with S-Unification. Declarative Programming 1991: 51-65
1980 – 1989
- 1988
- [c3]Feliks Kluzniak:
Compile Time Garbage Collection for Ground Prolog. ICLP/SLP 1988: 1490-1505 - [c2]Feliks Kluzniak, Miroslawa Milkowska:
Towards a "Middle Road" Methodology for Writing Code Generators. PLILP 1988: 105-118 - 1987
- [c1]Feliks Kluzniak:
Type Synthesis for Ground Prolog. ICLP 1987: 788-816 - 1984
- [p2]Feliks Kluzniak:
The 'Marseille Interpreter' - a Personal Perspective. Implementations of Prolog 1984: 65-70 - [p1]Feliks Kluzniak, Stan Szpakowicz:
Prolog - a Panacea? Implementations of Prolog 1984: 71-84
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-20 20:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
