Ana Teresa C. Martins
According to our database1, Ana Teresa C. Martins authored at least 27 papers between 1996 and 2020.
Legend:Book In proceedings Article PhD thesis Other
Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games.
Theor. Comput. Sci., 2020
Synthesis of Quantifier-Free First-Order Sentences from Noisy Samples of Strings.
Proceedings of the 8th Brazilian Conference on Intelligent Systems, 2019
On Distinguishing Sets of Structures by First-Order Sentences of Minimal Quantifier Rank.
Proceedings of the 13th Workshop on Logical and Semantic Frameworks with Applications, 2018
On Finding a First-Order Sentence Consistent with a Sample of Strings.
Proceedings of the Proceedings Ninth International Symposium on Games, 2018
Parameterized Complexity of Some Prefix-Vocabulary Fragments of First-Order Logic.
Proceedings of the Logic, Language, Information, and Computation, 2018
Synthesis of a DNF Formula From a Sample of Strings.
Proceedings of the 7th Brazilian Conference on Intelligent Systems, 2018
The Descriptive Complexity of Decision Problems through Logics with Relational Fixed-Point and Capturing Results.
Proceedings of the 11th Workshop on Logical and Semantic Frameworks with Applications, 2016
First-Order Logic for Decision Problems with Preference Aggregation.
Proceedings of the 5th Brazilian Conference on Intelligent Systems, 2016
Searching contexts in paraconsistent rough description logic.
J. Braz. Comp. Soc., 2015
Polynomial hierarchy graph properties in hybrid logic.
J. Comput. Syst. Sci., 2014
An ALC Description Default Logic with Exceptions-First.
Proceedings of the 2014 Brazilian Conference on Intelligent Systems, 2014
Searching Contexts in Rough Description Logics.
Proceedings of the Brazilian Conference on Intelligent Systems, 2013
Expressible preferential logics.
J. Log. Comput., 2012
Recursive definitions and fixed-points on well-founded structures.
Theor. Comput. Sci., 2011
Hybrid Logics and NP Graph Properties.
Proceedings of the Logic, Language, Information and Computation, 2011
Paraconsistent Rough Description Logic.
Proceedings of the 24th International Workshop on Description Logics (DL 2011), 2011
The Descriptive Complexity of the Deterministic Exponential Time Hierarchy.
Proceedings of the Fifth Logical and Semantic Frameworks, with Applications Workshop, 2010
A Tractable Paraconsistent Fuzzy Description Logic.
Proceedings of the 6th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2010), 2010
Natural deduction for the finite least fixed point logic with an infinitary rule.
Logic Journal of the IGPL, 2009
Recursive Definitions and Fixed-Points.
Proceedings of the Third Workshop on Logical and Semantic Frameworks with Applications, 2008
Full classical S5 in natural deduction with weak normalization.
Ann. Pure Appl. Log., 2008
On Minimal Models.
Logic Journal of the IGPL, 2007
An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models.
Proceedings of the Second Workshop on Logical and Semantic Frameworks, with Applications, 2007
Natural Deduction for Full S5 Modal Logic with Weak Normalization.
Electron. Notes Theor. Comput. Sci., 2006
The Predicate-Minimizing Logic MIN.
Proceedings of the Advances in Artificial Intelligence, 2006
Natural Deduction and Weak Normalization for Full Linear Logic.
Logic Journal of the IGPL, 2004
Well-Behaved IDL Theories.
Proceedings of the Advances in Artificial Intelligence, 1996