Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Salah Zouggar
Marco Seeber
Claudia Calabrese
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
Hua Qian
Radu Timofte
Kuanrui Yin
Home
/
Author
/
ANA TERESA MARTINS
Author Info
Open Visualization
Name
Affiliation
Papers
ANA TERESA MARTINS
Univ Fed Ceara, Dept Comp, Fortaleza, Ceara, Brazil
14
Collaborators
Citations
PageRank
13
2
4.80
Referers
Referees
References
5
102
82
Search Limit
100
102
Publications (14 rows)
Collaborators (13 rows)
Referers (5 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT.
0
0.34
2020
Synthesis of a DNF Formula from a Sample of Strings using Ehrenfeucht–Fraïssé Games
0
0.34
2020
Parameterized Complexity of Some Prefix-Vocabulary Fragments of First-Order Logic.
0
0.34
2018
The Descriptive Complexity of Decision Problems through Logics with Relational Fixed-Point and Capturing Results.
0
0.34
2017
Searching Contexts in Rough Description Logics.
1
0.36
2013
Expressible preferential logics
0
0.34
2012
The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
0
0.34
2011
Hybrid logics and NP graph properties
0
0.34
2011
Recursive definitions and fixed-points on well-founded structures
0
0.34
2011
Recursive Definitions and Fixed-Points
1
0.39
2009
An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models
0
0.34
2008
Full classical S5 in natural deduction with weak normalization
0
0.34
2008
The predicate-minimizing logic MIN
0
0.34
2006
Natural Deduction for Full S5 Modal Logic with Weak Normalization
0
0.34
2006
1