default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 700 matches
- 2023
- Mario Alviano:
Generative Datalog and Answer Set Programming - Extended Abstract. JELIA 2023: 3-10 - Mario Alviano, Laura Giordano, Daniele Theseider Dupré:
Complexity and Scalability of Defeasible Reasoning with Typicality in Many-Valued Weighted Knowledge Bases. JELIA 2023: 481-497 - Carlos Areces, Valentin Cassano, Pablo F. Castro, Raul Fervari, Andrés R. Saravia:
How Easy it is to Know How: An Upper Bound for the Satisfiability Problem. JELIA 2023: 405-419 - Carlos Areces, Valentin Cassano, Danae Dutto, Raul Fervari:
Data Graphs with Incomplete Information (and a Way to Complete Them). JELIA 2023: 729-744 - Franz Baader, Patrick Koopmann, Francesco Kriegel:
Optimal Repairs in the Description Logic Eℒ Revisited. JELIA 2023: 11-34 - Fausto Barbero, Jonni Virtema:
Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist Counterfactuals. JELIA 2023: 649-664 - Bartosz Bednarczyk:
Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features. JELIA 2023: 289-305 - Vaishak Belle:
Excursions in First-Order Logic and Probability: Infinitely Many Random Variables, Continuous Distributions, Recursive Programs and Beyond. JELIA 2023: 35-46 - Matti Berthold, Anna Rapberger, Markus Ulbricht:
On the Expressive Power of Assumption-Based Argumentation. JELIA 2023: 145-160 - Leopoldo E. Bertossi, Jorge E. Leon:
Efficient Computation of Shap Explanation Scores for Neural Network Classifiers via Knowledge Compilation. JELIA 2023: 49-64 - Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko:
Non-standard Modalities in Paraconsistent Gödel Logic. JELIA 2023: 420-436 - Marco De Bortoli, Lukás Chrpa, Martin Gebser, Gerald Steinbauer-Wagner:
Enhancing Temporal Planning by Sequential Macro-Actions. JELIA 2023: 595-604 - Alessandro Burigana, Paolo Felli, Marco Montali:
delphic: Practical DEL Planning via Possibilities. JELIA 2023: 579-594 - Pedro Cabalar, Agata Ciabattoni, Leendert van der Torre:
Deontic Equilibrium Logic with eXplicit Negation. JELIA 2023: 498-514 - Pedro Cabalar, Martín Diéguez, François Laferrière, Torsten Schaub:
Past-Present Temporal Programs over Finite Traces. JELIA 2023: 787-795 - Pedro Cabalar, David Pearce:
Logic, Accountability and Design: Extended Abstract. JELIA 2023: 65-72 - Igor de Camargo e Souza Câmara, Anni-Yasmin Turhan:
Deciding Subsumption in Defeasible $\mathcal {ELI}_\bot $ with Typicality Models. JELIA 2023: 531-546 - Angelos Charalambidis, Panos Rondogiannis:
Categorical Approximation Fixpoint Theory. JELIA 2023: 515-530 - Lukás Chrpa, Carmine Dodaro, Marco Maratea, Marco Mochi, Mauro Vallati:
Comparing Planning Domain Models Using Answer Set Programming. JELIA 2023: 227-242 - Tiziano Dalmonte, Andrea Mazzullo, Ana Ozaki, Nicolas Troquard:
Non-Normal Modal Description Logics. JELIA 2023: 306-321 - Stéphane Demri, Karin Quaas:
First Steps Towards Taming Description Logics with Strings. JELIA 2023: 322-337 - Sjur K. Dyrkolbotn:
Weak Argumentation Semantics and Unsafe Odd Cycles: Results and a Conjecture. JELIA 2023: 161-175 - Thomas Eiter, Tobias Geibinger, Johannes Oetsch:
Contrastive Explanations for Answer-Set Programs. JELIA 2023: 73-89 - Mohammed M. S. El-Kholany, Ramsha Ali, Martin Gebser:
Hybrid ASP-Based Multi-objective Scheduling of Semiconductor Manufacturing Processes. JELIA 2023: 243-252 - Saurabh Fadnis, Jussi Rintanen:
Planning with Partial Observability by SAT. JELIA 2023: 605-620 - Jorge Fandinno, Vladimir Lifschitz:
On Heuer's Procedure for Verifying Strong Equivalence. JELIA 2023: 253-261 - David Fernández-Duque, Konstantinos Papafilippou:
The Universal Tangle for Spatial Reasoning. JELIA 2023: 814-827 - Cecilia Di Florio, Antonino Rotolo, Guido Governatori, Giovanni Sartor:
Stable Normative Explanations: From Argumentation to Deontic Logic. JELIA 2023: 123-131 - Robert Freiman, Michael Bernreiter:
Truth and Preferences - A Game Approach for Qualitative Choice Logic. JELIA 2023: 547-560 - Enrico Giunchiglia, Armando Tacchella:
Optimal Planning with Expressive Action Languages as Constraint Optimization. JELIA 2023: 621-637
skipping 670 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-01-13 08:06 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint