default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafael Kiesel
Person information
- affiliation: Vienna University of Technology, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Thomas Eiter
, Markus Hecher, Rafael Kiesel:
aspmc: New frontiers of algebraic answer set counting. Artif. Intell. 330: 104109 (2024)- [c16]Markus Hecher, Rafael Kiesel:
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? AAAI 2024: 10535-10543 - [i9]Markus Hecher, Rafael Kiesel:
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? CoRR abs/2402.03539 (2024) - [i8]Damiano Azzolini, Elena Bellodi, Rafael Kiesel, Fabrizio Riguzzi:
Solving Decision Theory Problems with Probabilistic Answer Set Programming. CoRR abs/2408.11371 (2024) - 2023
- [j5]Thomas Eiter, Rafael Kiesel:
Semiring Reasoning Frameworks in AI and Their Computational Complexity. J. Artif. Intell. Res. 77: 207-293 (2023) - [j4]Rafael Kiesel, Kilian Rückschloß, Felix Weitkämper:
"What if?" in Probabilistic Logic Programming. Theory Pract. Log. Program. 23(4): 884-899 (2023) - [c15]Rafael Kiesel, André Schidler:
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. ALENEX 2023: 39-52 - [c14]Loris Bozzato, Thomas Eiter, Rafael Kiesel, Daria Stepanova:
Semantically Guided Scene Generation via Contextual Reasoning and Algebraic Measures. ICLP Workshops 2023 - [c13]Markus Hecher, Rafael Kiesel:
The Impact of Structure in Answer Set Counting: Fighting Cycles and its Limits. KR 2023: 344-354 - [c12]Rafael Kiesel, Thomas Eiter:
Knowledge Compilation and More with SharpSAT-TD. KR 2023: 406-416 - [p1]Rafael Kiesel:
Zeitliche und Quantitative Erweiterungen der Antwortmengenprogrammierung. Ausgezeichnete Informatikdissertationen 2023: 151-160 - [i7]Loris Bozzato, Thomas Eiter, Rafael Kiesel, Daria Stepanova:
Contextual Reasoning for Scene Generation (Technical Report). CoRR abs/2305.02255 (2023) - [i6]Rafael Kiesel, Kilian Rückschloß, Felix Weitkämper:
"What if?" in Probabilistic Logic Programming. CoRR abs/2305.15318 (2023) - 2022
- [j3]Rafael Kiesel, Pietro Totis, Angelika Kimmig:
Efficient Knowledge Compilation Beyond Weighted Model Counting. Theory Pract. Log. Program. 22(4): 505-522 (2022) - [c11]Loris Bozzato, Thomas Eiter, Rafael Kiesel:
Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures (Extended Abstract). Description Logics 2022 - [c10]Rafael Kiesel, André Schidler:
PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT. IPEC 2022: 32:1-32:4 - [i5]Rafael Kiesel, Pietro Totis, Angelika Kimmig:
Efficient Knowledge Compilation Beyond Weighted Model Counting. CoRR abs/2205.07496 (2022) - [i4]Rafael Kiesel, André Schidler:
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. CoRR abs/2211.06109 (2022) - 2021
- [j2]Loris Bozzato, Thomas Eiter, Rafael Kiesel:
Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures. Theory Pract. Log. Program. 21(5): 593-609 (2021) - [c9]Thomas Eiter, Rafael Kiesel:
On the Complexity of Sum-of-Products Problems over Semirings. AAAI 2021: 6304-6311 - [c8]Thomas Eiter, Markus Hecher, Rafael Kiesel:
aspmc: An Algebraic Answer Set Counter. ICLP Workshops 2021 - [c7]Thomas Eiter, Markus Hecher, Rafael Kiesel:
Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. KR 2021: 269-279 - [c6]Rafael Kiesel:
Quantitative and Stream Extensions of Answer Set Programming. ICLP Technical Communications 2021: 267-275 - [i3]Loris Bozzato, Thomas Eiter, Rafael Kiesel:
Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures. CoRR abs/2108.03100 (2021) - [i2]Rafael Kiesel, Anna Rapberger:
Concurrence for well-formed CAFs: Naive Semantics. CoRR abs/2112.10445 (2021) - 2020
- [j1]Thomas Eiter, Rafael Kiesel:
ASP(𝓐𝒞): Answer Set Programming with Algebraic Constraints. Theory Pract. Log. Program. 20(6): 895-910 (2020) - [c5]Thomas Eiter, Rafael Kiesel:
Weighted LARS for Quantitative Stream Reasoning. ECAI 2020: 729-736 - [i1]Thomas Eiter, Rafael Kiesel:
ASP(AC): Answer Set Programming with Algebraic Constraints. CoRR abs/2008.04008 (2020)
2010 – 2019
- 2019
- [c4]David M. Cerna, Rafael P. D. Kiesel, Alexandra Dzhiganskaya:
A Mobile Application for Self-Guided Study of Formal Reasoning. ThEdu@CADE 2019: 35-53 - 2018
- [c3]Rafael Kiesel, Erman Acar, Stefan Schlobach:
Preferential Default Reasoning on the Semantic Web. Description Logics 2018 - 2017
- [c2]Milan Jelisavcic, Rafael Kiesel, Kyrre Glette, Evert Haasdijk, A. E. Eiben:
Analysis of Lamarckian evolution in morphologically evolving robots. ECAL 2017: 214-221 - [c1]Milan Jelisavcic, Rafael Kiesel, Kyrre Glette, Evert Haasdijk, A. E. Eiben:
Benefits of lamarckian evolution for morphologically evolving robots. GECCO (Companion) 2017: 65-66
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 2025-01-13 01:08 CET 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:
