Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Ulbricht 0001
Person information
- affiliation: Leipzig University, Germany
Other persons with the same name
- Markus Ulbricht 0002 — IHP - Leibniz-Institut für innovative Mikroelektronik, Frankfurt/Oder, Germany (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Ringo Baumann
, Gerhard Brewka, Markus Ulbricht:
Shedding new light on the foundations of abstract argumentation: Modularization and weak admissibility. Artif. Intell. 310: 103742 (2022)- [j4]Wolfgang Dvorák, Markus Ulbricht, Stefan Woltran:
Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. J. Artif. Intell. Res. 74: 1403-1447 (2022) - [c23]Ringo Baumann, Anna Rapberger, Markus Ulbricht:
Equivalence in Argumentation Frameworks with a Claim-Centric View - Classical Results with Novel Ingredients. AAAI 2022: 5479-5486 - [c22]Matthias König, Anna Rapberger, Markus Ulbricht:
Just a Matter of Perspective. COMMA 2022: 212-223 - [c21]Markus Ulbricht, Johannes Peter Wallner:
Strongly Accepting Subframeworks: Connecting Abstract and Structured Argumentation. COMMA 2022: 320-331 - [c20]Lydia Blümel, Markus Ulbricht:
Defining Defense and Defeat in Abstract Argumentation From Scratch - A Generalizing Approach. KR 2022 - [c19]Wolfgang Dvorák, Matthias König, Markus Ulbricht, Stefan Woltran:
Rediscovering Argumentation Principles Utilizing Collective Attacks. KR 2022 - [c18]Anna Rapberger, Markus Ulbricht:
On Dynamics in Structured Argumentation Formalisms. KR 2022 - [c17]Anna Rapberger, Markus Ulbricht, Johannes Peter Wallner:
Argumentation Frameworks Induced by Assumption-Based Argumentation: Relating Size and Complexity. NMR 2022: 92-103 - [i1]Wolfgang Dvorák, Matthias König, Markus Ulbricht, Stefan Woltran:
Rediscovering Argumentation Principles Utilizing Collective Attacks. CoRR abs/2205.03151 (2022) - 2021
- [c16]Wolfgang Dvorák, Markus Ulbricht, Stefan Woltran:
Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. AAAI 2021: 6288-6295 - [c15]Markus Ulbricht, Johannes Peter Wallner:
Strong Explanations in Abstract Argumentation. AAAI 2021: 6496-6504 - [c14]Kevin Stier, Markus Ulbricht:
Disambiguation of Weighted Tree Automata. DCFS 2021: 163-175 - [c13]Ringo Baumann, Markus Ulbricht:
On Cycles, Attackers and Supporters - A Contribution to The Investigation of Dynamics in Abstract Argumentation. IJCAI 2021: 1780-1786 - [c12]Ringo Baumann, Gerhard Brewka, Markus Ulbricht:
Comparing Weak Admissibility Semantics to their Dung-style Counterparts (Extended Abstract). IJCAI 2021: 4740-4744 - [c11]Ringo Baumann, Markus Ulbricht:
Choices and their Consequences - Explaining Acceptable Sets in Abstract Argumentation Frameworks. KR 2021: 110-119 - [c10]Markus Ulbricht:
On the Maximal Number of Complete Extensions in Abstract Argumentation Frameworks. KR 2021: 707-711 - [c9]Andreas Maletti, Teodora Nasz, Kevin Stier, Markus Ulbricht:
Ambiguity Hierarchies for Weighted Tree Automata. CIAA 2021: 140-151 - 2020
- [j3]Markus Ulbricht, Matthias Thimm, Gerhard Brewka:
Handling and measuring inconsistency in non-monotonic logics. Artif. Intell. 286: 103344 (2020) - [c8]Ringo Baumann, Gerhard Brewka, Markus Ulbricht:
Revisiting the Foundations of Abstract Argumentation - Semantics Based on Weak Admissibility and Weak Defense. AAAI 2020: 2742-2749 - [c7]Ringo Baumann, Gerhard Brewka, Markus Ulbricht:
Comparing Weak Admissibility Semantics to their Dung-style Counterparts - Reduct, Modularization, and Strong Equivalence in Abstract Argumentation. KR 2020: 79-88
2010 – 2019
- 2019
- [b1]Markus Ulbricht:
Understanding Inconsistency - A Contribution to the Field of Non-monotonic Reasoning. Leipzig University, Germany, 2019 - [j2]Gerhard Brewka, Matthias Thimm, Markus Ulbricht:
Strong inconsistency. Artif. Intell. 267: 78-117 (2019) - [j1]Markus Ulbricht, Ringo Baumann:
If Nothing Is Accepted - Repairing Argumentation Frameworks. J. Artif. Intell. Res. 66: 1099-1145 (2019) - [c6]Gerhard Brewka, Markus Ulbricht:
Strong Explanations for Nonmonotonic Reasoning. Description Logic, Theory Combination, and All That 2019: 135-146 - [c5]Markus Ulbricht:
Repairing Non-monotonic Knowledge Bases. JELIA 2019: 151-167 - 2018
- [c4]Markus Ulbricht, Matthias Thimm, Gerhard Brewka:
Measuring Strong Inconsistency. AAAI 2018: 1989-1996 - [c3]Ringo Baumann, Markus Ulbricht:
If Nothing Is Accepted - Repairing Argumentation Frameworks. KR 2018: 108-117 - 2017
- [c2]Gerhard Brewka, Matthias Thimm, Markus Ulbricht:
Strong Inconsistency in Nonmonotonic Reasoning. IJCAI 2017: 901-907 - 2016
- [c1]Markus Ulbricht, Matthias Thimm, Gerhard Brewka:
Measuring Inconsistency in Answer Set Programs. JELIA 2016: 577-583
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-03-22 22:28 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:
