Inmaculada Perez de Guzmán

According to our database1, Inmaculada Perez de Guzmán
  • authored at least 49 papers between 1992 and 2014.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
A tableaux-like method to infer all minimal keys.
Logic Journal of the IGPL, 2014

2011
Ideal non-deterministic operators as a formal framework to reduce the key finding problem.
Int. J. Comput. Math., 2011

An Efficient Algorithm for Reasoning about Fuzzy Functional Dependencies.
Proceedings of the Advances in Computational Intelligence, 2011

Specification and inference of fuzzy attributes.
Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2011

2010
Analyzing completeness of axiomatic functional systems for temporal × modal logics.
Math. Log. Q., 2010

2009
Functional systems in the context of temporal×modal logics with indexed flows.
Int. J. Comput. Math., 2009

A Complete Logic for Fuzzy Functional Dependencies over Domains with Similarity Relations.
Proceedings of the Bio-Inspired Systems: Computational and Ambient Intelligence, 2009

2008
Generalization of some properties of relations in the context of functional temporal×modal logic.
Int. J. Comput. Math., 2008

Non-deterministic ideal operators: An adequate tool for formalization in Data Bases.
Discrete Applied Mathematics, 2008

2006
A new closure algorithm based in logic: SLFD-Closure versus classical closures.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2006

MAT Logic: A Temporal×Modal Logic with Non-deterministic Operators to Deal with Interactive Systems in Communication Technologies.
Proceedings of the Advances in Artificial Intelligence, 2006

2005
Generalizations of lattices via non-deterministic operators.
Discrete Mathematics, 2005

2004
Formalization of UML state machines using temporal logic.
Software and System Modeling, 2004

A New Algebraic Tool for Automatic Theorem Provers.
Ann. Math. Artif. Intell., 2004

Una forma normal temporal independiente del método de deducción.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2004

A Non-explosive Treatment of Functional Dependencies Using Rewriting Logic.
Proceedings of the Advances in Artificial Intelligence - SBIA 2004, 17th Brazilian Symposium on Artificial Intelligence, São Luis, Maranhão, Brazil, September 29, 2004

A/D Case: A New Heart for FD3.
Proceedings of the ICEIS 2004, 2004

2003
Restricted ideals and the groupability property. Tools for temporal reasoning.
Kybernetika, 2003

A functional approach for temporal × modal logics.
Acta Inf., 2003

An Efficient Preprocessing Transformation for Functional Dependencies Sets Based on the Substitution Paradigm.
Proceedings of the Current Topics in Artificial Intelligence, 2003

2002
Preface.
Studia Logica, 2002

Satisfiability Testing for Boolean Formulas Using Delta-trees.
Studia Logica, 2002

From the Poset of Temporal Implicates/implicants to a Temporal Negative Form.
Reports on Mathematical Logic, 2002

Bases for closed sets of implicants and implicates in temporal logic.
Acta Inf., 2002

Indexed Flows in Temporal x Modal Logic with Functional Semantics.
Proceedings of the 9th International Symposium on Temporal Representation and Reasoning, 2002

Restricted Delta-Trees and Reduction Theorems in Multiple-Valued Logics.
Proceedings of the Advances in Artificial Intelligence, 2002

SLFD Logic: Elimination of Data Redundancy in Knowledge Representation.
Proceedings of the Advances in Artificial Intelligence, 2002

A Temporal × Modal Approach to the Definability of Properties of Functions.
Proceedings of the Frontiers of Combining Systems, 4th International Workshop, 2002

Restricted Delta-Trees in Multiple-Valued Logics.
Proceedings of the Artificial Intelligence: Methodology, 2002

2001
Reductions for non-clausal theorem proving.
Theor. Comput. Sci., 2001

2000
A temporal negative normal form which preserves implicants and implicates.
Journal of Applied Non-Classical Logics, 2000

A Tableau Calculus for Equilibrium Entailment.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

Reduction Theorems for Boolean Formulas Using Delta-Trees.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 2000

Computing Equilibrium Models Using Signed Formulas.
Proceedings of the Computational Logic, 2000

1999
Implicates and reduction techniques for temporal logics.
Ann. Math. Artif. Intell., 1999

Multiple-Valued Tableaux with delta-reductions.
Proceedings of the International Conference on Artificial Intelligence, 1999

Structure Theorems for Closed Sets of Implicates/ Implicants in Temporal Logic.
Proceedings of the Progress in Artificial Intelligence, 1999

1998
Reducing signed propositional formulas.
Soft Comput., 1998

Implicates and Reduction Techniques for Temporal Logics.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

1996
Temporal Reasoning over Linear Discrete Time.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1996

Executing Intensional Logic with the TAS Tool.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995
Increasing the efficiency of automated theorem proving.
Journal of Applied Non-Classical Logics, 1995

LNint: A Temporal Logic that Combines Points and Intervals and the Absolute and Relative Approaches.
Logic Journal of the IGPL, 1995

A Formal Identification between Tuples and Lists with an Application to List-Arithmetic Categories.
Acta Inf., 1995

1994
TAS-D++: Syntactic Trees Transformations for Automated Theorem Proving.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1994

A Temporal Logic for Program Specification.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

TAS-D++ vs tablas semanticas.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

1993
Pipelines for Divide-and-Conquer Functions.
Comput. J., 1993

1992
A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete time.
Journal of Applied Non-Classical Logics, 1992


  Loading...