![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 35 matches
- 2008
- Felicidad Aguado, Pedro Cabalar, Gilberto Pérez, Concepción Vidal
:
Strongly Equivalent Temporal Logic Programs. JELIA 2008: 8-20 - Sergei N. Artëmov:
Justification Logic. JELIA 2008: 1-4 - Guillaume Aucher:
Consistency Preservation and Crazy Formulas in BMS. JELIA 2008: 21-33 - David Billington:
Propositional Clausal Defeasible Logic. JELIA 2008: 34-47 - Laura Bozzelli, Ruggero Lanotte
:
Complexity and Succinctness Issues for Linear-Time Hybrid Logics. JELIA 2008: 48-61 - Davide Bresolin
, Angelo Montanari, Pietro Sala
, Guido Sciavicco
:
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders. JELIA 2008: 62-75 - Annamaria Bria, Wolfgang Faber
, Nicola Leone
:
Normal Form Nested Programs. JELIA 2008: 76-88 - Jan M. Broersen, Rosja Mastop, John-Jules Ch. Meyer, Paolo Turrini:
A Logic for Closed-World Interaction. JELIA 2008: 89-99 - Luciano Caroprese
, Miroslaw Truszczynski:
Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints. JELIA 2008: 100-112 - Sylvie Coste-Marquis
, Pierre Marquis:
Recovering Consistency by Forgetting Inconsistency. JELIA 2008: 113-125 - Fabio Cuzzolin:
On the Credal Structure of Consistent Probabilities. JELIA 2008: 126-139 - Conrad Drescher, Michael Thielscher:
A Fluent Calculus Semantics for ADL with Plan Constraints. JELIA 2008: 140-152 - Paul E. Dunne
, Martin Caminada
:
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks. JELIA 2008: 153-165 - Thomas Eiter, Georg Gottlob
, Magdalena Ortiz
, Mantas Simkus
:
Query Answering in the Description Logic Horn-. JELIA 2008: 166-179 - Satu Eloranta, Raul Hakli
, Olli Niinivaara, Matti Nykänen:
Accommodative Belief Revision. JELIA 2008: 180-191 - Laura Giordano
, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato
:
Reasoning about Typicality in Preferential Description Logics. JELIA 2008: 192-205 - Miki Hermann, Reinhard Pichler:
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction. JELIA 2008: 206-218 - Andreas Herzig, Jérôme Mengin:
Uniform Interpolation by Resolution in Modal Logic. JELIA 2008: 219-231 - Norihiro Kamide:
Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials. JELIA 2008: 245-257 - Ekaterina Komendantskaya, John Power
:
Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness. JELIA 2008: 258-271 - Sébastien Konieczny
, Ramón Pino Pérez:
Confluence Operators. JELIA 2008: 272-284 - Jérôme Lang:
Voting in Combinatorial Domains: What Logic and AI Have to Say. JELIA 2008: 5-7 - Paul-Amaury Matt, Francesca Toni
:
A Game-Theoretic Measure of Argument Strength for Abstract Argumentation. JELIA 2008: 285-297 - John Christopher McCabe-Dansted:
A Tableau for RoBCTL*. JELIA 2008: 298-310 - Novak Novakovic:
A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in w.r.t. Hybrid TBoxes. JELIA 2008: 311-323 - Magdalena Ortiz
:
Extending Carinto the Description Logics of the Family. JELIA 2008: 324-337 - Aleksandar Perovic, Zoran Ognjanovic, Miodrag Raskovic, Zoran Markovic:
How to Restore Compactness into Probabilistic Logics?. JELIA 2008: 338-348 - Henry Prakken:
Combining Modes of Reasoning: An Application of Abstract Argumentation. JELIA 2008: 349-361 - Sebastian Rudolph
, Markus Krötzsch
, Pascal Hitzler:
Cheap Boolean Role Constructors for Description Logics. JELIA 2008: 362-374 - Renate A. Schmidt
:
Improved Second-Order Quantifier Elimination in Modal Logic. JELIA 2008: 375-388
skipping 5 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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 2024-07-22 18:36 CEST 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