default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancicleber Martins Ferreira
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j6]Thiago Alves Rocha
, Ana Teresa C. Martins, Francicleber Martins Ferreira:
Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games. Theor. Comput. Sci. 805: 109-126 (2020)- [j5]Thiago Alves Rocha, Ana Teresa C. Martins, Francicleber Martins Ferreira:
Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT. Theor. Comput. Sci. 843: 115-135 (2020)
2010 – 2019
- 2018
- [c8]Thiago Alves Rocha, Ana Teresa C. Martins, Francicleber Martins Ferreira:
Synthesis of a DNF Formula From a Sample of Strings. BRACIS 2018: 534-539 - [c7]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 - [c6]Thiago Alves Rocha, Ana Teresa C. Martins, Francicleber Martins Ferreira:
On Finding a First-Order Sentence Consistent with a Sample of Strings. GandALF 2018: 220-234 - [c5]Thiago Alves Rocha, Ana Teresa C. Martins, Francicleber Martins Ferreira:
On Distinguishing Sets of Structures by First-Order Sentences of Minimal Quantifier Rank. LSFA 2018: 189-208 - 2016
- [c4]Márcia Farias, Ana Teresa C. Martins, Francicleber Martins Ferreira:
The Descriptive Complexity of Decision Problems through Logics with Relational Fixed-Point and Capturing Results. LSFA 2016: 113-130 - 2014
- [j4]Francicleber Martins Ferreira, Cibele Matos Freire, Mario R. F. Benevides, Luis Menasché Schechter, Ana Teresa C. Martins:
Polynomial hierarchy graph properties in hybrid logic. J. Comput. Syst. Sci. 80(6): 1087-1101 (2014) - 2012
- [b1]Francicleber Martins Ferreira:
Expressividade e complexidade em lógicas preferenciais, híbridas e de grau limitado. Federal University of Ceará, Fortaleza, Brazil, 2012 - [j3]Francicleber Martins Ferreira, Ana Teresa C. Martins:
Expressible preferential logics. J. Log. Comput. 22(5): 1125-1143 (2012) - 2011
- [j2]Francicleber Martins Ferreira, Ana Teresa C. Martins:
Recursive definitions and fixed-points on well-founded structures. Theor. Comput. Sci. 412(37): 4893-4904 (2011) - [c3]Francicleber Martins Ferreira, Cibele Matos Freire, Mario R. F. Benevides, Luis Menasché Schechter, Ana Teresa C. Martins:
Hybrid Logics and NP Graph Properties. WoLLIC 2011: 123-134
2000 – 2009
- 2008
- [c2]Francicleber Martins Ferreira, Ana Teresa C. Martins:
Recursive Definitions and Fixed-Points. LSFA 2008: 19-37 - 2007
- [j1]Francicleber Martins Ferreira, Ana Teresa C. Martins:
On Minimal Models. Log. J. IGPL 15(5-6): 503-526 (2007) - 2006
- [c1]Francicleber Martins Ferreira, Ana Teresa C. Martins:
The Predicate-Minimizing Logic MIN. IBERAMIA-SBIA 2006: 582-591
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 2024-04-24 23:13 CEST 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:
