Manuel Enciso

According to our database1, Manuel Enciso
  • authored at least 53 papers between 1994 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Reducing the search space by closure and simplification paradigms.
The Journal of Supercomputing, 2017

Canonical dichotomous direct bases.
Inf. Sci., 2017

An Axiomatic System for Conditional Attribute Implications in Triadic Concept Analysis.
Int. J. Intell. Syst., 2017

Formation of the D-basis from implicational systems using Simplification logic.
Int. J. General Systems, 2017

Fuzzy functional dependencies: A comparative survey.
Fuzzy Sets and Systems, 2017

2016
Concept lattices with negative information: A characterization theorem.
Inf. Sci., 2016

Automated prover for attribute dependencies in data with grades.
Int. J. Approx. Reasoning, 2016

CAISL: Simplification Logic for Conditional Attribute Implications.
Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications, 2016

2015
Knowledge discovery in social networks by using a logic-based treatment of implications.
Knowl.-Based Syst., 2015

A Normal Form for Fuzzy Functional Dependencies.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2015

From an Implicational System to its Corresponding D-basis.
Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, 2015

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

Negative Attributes and Implications in Formal Concept Analysis.
Proceedings of the Second International Conference on Information Technology and Quantitative Management, 2014

Increasing the Efficiency of Minimal Key Enumeration Methods by Means of Parallelism.
Proceedings of the ICSOFT-EA 2014, 2014

A Generalized Framework to Consider Positive and Negative Attributes in Formal Concept Analysis.
Proceedings of the Eleventh International Conference on Concept Lattices and Their Applications, 2014

The Direct-optimal Basis via Reductions.
Proceedings of the Eleventh International Conference on Concept Lattices and Their Applications, 2014

2013
Automated Inference with Fuzzy Functional Dependencies over Graded Data.
Proceedings of the Advances in Computational Intelligence, 2013

Automated Reasoning to Infer all Minimal Keys.
Proceedings of the IJCAI 2013, 2013

Bases via Minimal Generators.
Proceedings of the International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI at IJCAI 2013), 2013

Improving Recommender Systems with Simplification Logic to Manage Implications with Grades.
Proceedings of the Software Technologies - 8th International Joint Conference, 2013

Context-aware Recommendation using Fuzzy Formal Concept Analysis.
Proceedings of the ICSOFT 2013, 2013

Quality Improvement in Data Models with SLFD-based OCL Constraints.
Proceedings of the ICSOFT 2013, 2013

Computing non-redundant sets of functional dependencies via simplification.
Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2013

Teaching database design: A reverse engineering approach.
Proceedings of the IEEE Global Engineering Education Conference, 2013

Computing Left-Minimal Direct Basis of implications.
Proceedings of the Tenth International Conference on Concept Lattices and Their Applications, 2013

2012
Closure via functional dependence simplification.
Int. J. Comput. Math., 2012

An Efficient Reasoning Method for Dependencies over Similarity and Ordinal Data.
Proceedings of the Modeling Decisions for Artificial Intelligence, 2012

A Metamodel for Functional Dependencies - Towards a Functional Dependency Model Transformation.
Proceedings of the ICSOFT 2012 - Proceedings of the 7th International Conference on Software Paradigm Trends, Rome, Italy, 24, 2012

Computing Minimal Generators from Implications: a Logic-guided Approach.
Proceedings of The Ninth International Conference on Concept Lattices and Their Applications, 2012

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

A Claim to Incorporate Functional Dependencies in Development Tools - Benchmarking and Checking Functional Dependencies Algorithms.
Proceedings of the ICSOFT 2011, 2011

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

2010
A Tool for User-guided Database Application Development - Automatic Design of XML Models using CBD.
Proceedings of the ICSOFT 2010, 2010

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
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

A Formal Tool that Integrates Relational Database Schemes and Preserves the Original Information.
Proceedings of the ICEIS 2006, 2006

2004
Formalization of UML state machines using temporal logic.
Software and System Modeling, 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

A First Order Temporal Logic for Behavior Representation.
Proceedings of the Advances in Artificial Intelligence, 2004

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

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

FD3: A Functional Dependencies Data Dictionary.
Proceedings of the ICEIS 2002, 2002

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

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

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

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

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


  Loading...