Остановите войну!
for scientists:
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 80 matches
- 2024
- Balder ten Cate:
Craig Interpolation for Decidable Fragments of First-Order Logic (Invited Talk). CSL 2024: 2:1-2:2 - 2022
- Emanuele Frittaion:
A note on Fragments of Uniform Reflection in second order Arithmetic. Bull. Symb. Log. 28(3): 451-465 (2022) - Lorenzo Galeotti, Benedikt Löwe:
Order Types of Models of Fragments of Peano Arithmetic. Bull. Symb. Log. 28(2): 182-206 (2022) - Aldo Figallo Orellano, Juan Sebastian Slagter:
An Algebraic Study of the First Order Version of some Implicational Fragments of Three-Valued Łukasiewicz Logic. Computación y Sistemas 26(2) (2022) - Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
On the Existential Fragments of Local First-Order Logics with Data. GandALF 2022: 1-16 - 2021
- Marco Voigt:
Decidable ∃ *∀ * First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates. J. Autom. Reason. 65(3): 357-423 (2021) - Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. CSL 2021: 27:1-27:22 - Reijo Jaakkola:
Ordered Fragments of First-Order Logic. MFCS 2021: 62:1-62:14 - Reijo Jaakkola:
Ordered fragments of first-order logic. CoRR abs/2103.08046 (2021) - 2020
- Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder:
Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. FoSSaCS 2020: 97-118 - Reijo Jaakkola, Antti Kuusisto:
Algebraic classifications for fragments of first-order logic and beyond. CoRR abs/2005.01184 (2020) - Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. CoRR abs/2007.03867 (2020) - Aldo Figallo Orellano, Juan Sebastian Slagter:
An algebraic study of the first order version of some implicational fragments of the three-valued Lukasiewicz logic. CoRR abs/2011.09868 (2020) - 2019
- Matthias Hoelzel:
Fragments of existential second-order logic and logics with team semantics. RWTH Aachen University, Germany, 2019 - Marco Voigt:
Decidable fragments of first-order logic and of first-order linear arithmetic with uninterpreted predicates. Saarland University, Saarbrücken, Germany, 2019 - Zhiqiang Zhuang, Zhe Wang, Kewen Wang, James P. Delgrande:
A Generalisation of AGM Contraction and Revision to Fragments of First-Order Logic. J. Artif. Intell. Res. 64: 147-179 (2019) - Ian Pratt-Hartmann:
Transitivity and Equivalence in Decidable Fragments of First-Order Logic: A Survey. ICLA 2019: 103-107 - Sophie Tourret, Andrew Cropper:
SLD-Resolution Reduction of Second-Order Horn Fragments. JELIA 2019: 259-276 - Sophie Tourret, Andrew Cropper:
SLD-Resolution Reduction of Second-Order Horn Fragments - technical report -. CoRR abs/1902.09900 (2019) - Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder:
Parameterized Synthesis for Fragments of First-Order Logic over Data Words. CoRR abs/1910.14294 (2019) - Marco Voigt:
Separateness of Variables - A Novel Perspective on Decidable First-Order Fragments. CoRR abs/1911.11500 (2019) - 2018
- Mauricio Martel:
Conservative Extensions and Satisfiability in Fragments of First-Order Logic: Complexity and Expressive Power. University of Bremen, Germany, 2018 - Lars Kristiansen, Juvenal Murwanashyaka:
Decidable and Undecidable Fragments of First-Order Concatenation Theory. CiE 2018: 244-253 - Lidia Tendera:
Decidability Frontier for Fragments of First-Order Logic with Transitivity. Description Logics 2018 - Anantha Padmanabha, R. Ramanujam, Yanjing Wang:
Bundled Fragments of First-Order Modal Logic: (Un)Decidability. FSTTCS 2018: 43:1-43:20 - Luis Henrique Bustamante, Ana Teresa C. Martins, Francicleber Martins Ferreira:
Parameterized Complexity of Some Prefix-Vocabulary Fragments of First-Order Logic. WoLLIC 2018: 163-178 - Anantha Padmanabha, R. Ramanujam, Yanjing Wang:
Bundled fragments of first-order modal logic: (un)decidability. CoRR abs/1803.10508 (2018) - Christopher Hampson:
Decidable fragments of first-order modal logics with counting quantifiers over varying domains. CoRR abs/1812.06341 (2018) - 2017
- Gianpaolo Maria Ruotolo:
Fragments of fragments. The domain name system regulation: global law or informalization of the international legal order? Comput. Law Secur. Rev. 33(2): 159-170 (2017) - Florian Bruse, Martin Lange, Étienne Lozes:
Space-Efficient Fragments of Higher-Order Fixpoint Logic. RP 2017: 26-41
skipping 50 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 2024-04-25 15:15 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