Maria Ines Camarate de Campos Lynce de Faria


AuthID: R-000-BN4

Confirmed Publications: 62



21
TITLE: Improving Unsatisfiability-Based Algorithms for Boolean Optimization
AUTHORS: Manquinho, V ; Martins, R; Lynce, I ;
PUBLISHED: 2010, SOURCE: 13th International Conference on Theory and Applications of Satisfiability Testing in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2010, PROCEEDINGS, VOLUME: 6175
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
22
TITLE: New Insights into Encodings from MaxCSP into Partial MaxSAT
AUTHORS: Josep Argelich; Alba Cabiscol; Ines Lynce ; Felip Manya;
PUBLISHED: 2010, SOURCE: 40th International Symposium on Multiple-Valued Logic (ISMVL) in 40TH IEEE INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC ISMVL 2010
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
23
TITLE: On Computing Backbones of Propositional Theories
AUTHORS: Joao Marques Silva ; Mikolas Janota; Ines Lynce ;
PUBLISHED: 2010, SOURCE: 19th European Conference on Artificial Intelligence (ECAI)/6th Conference on Prestigious Applications of Intelligent Systems (PAIS) in ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLUME: 215
INDEXED IN: Scopus WOS DBLP
IN MY: ORCID
24
TITLE: The seventh QBF solvers evaluation (QBFEVAL'10)
AUTHORS: Peschiera, C; Pulina, L; Tacchella, A; Bubeck, U; Kullmann, O; Lynce, I ;
PUBLISHED: 2010, SOURCE: 13th International Conference on Theory and Applications of Satisfiability Testing, SAT 2010 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 6175 LNCS
INDEXED IN: Scopus CrossRef
IN MY: ORCID
25
TITLE: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas  Full Text
AUTHORS: Liffiton, M; Mneimneh, M; Lynce, I ; Andraus, Z; Marques Silva, J ; Sakallah, K;
PUBLISHED: 2009, SOURCE: CONSTRAINTS, VOLUME: 14, ISSUE: 4
INDEXED IN: Scopus WOS DBLP CrossRef Unpaywall
IN MY: ORCID
26
TITLE: CNF instances from the software package installation problem
AUTHORS: Argelich, J; Lynce, I ;
PUBLISHED: 2009, SOURCE: 15th Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA 2008 in CEUR Workshop Proceedings, VOLUME: 451
INDEXED IN: Scopus
IN MY: ORCID
27
TITLE: Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization
AUTHORS: Joao Delgado; Ines Lynce ; Vasco Manquinho ;
PUBLISHED: 2009, SOURCE: 7th Annual RECOMB on Comparative Genomic in COMPARATIVE GENOMICS, PROCEEDINGS, VOLUME: 5817
INDEXED IN: Scopus WOS CrossRef
IN MY: ORCID
28
TITLE: Conflict-Driven Clause Learning SAT Solvers
AUTHORS: João P Marques Silva ; Inês Lynce ; Sharad Malik;
PUBLISHED: 2009, SOURCE: Handbook of Satisfiability, VOLUME: 185, ISSUE: 1
INDEXED IN: Scopus DBLP
IN MY: ORCID
29
TITLE: On Solving Boolean Multilevel Optimization Problems PDF
AUTHORS: Argelich, J; Lynce, I ; Marques Silva, J ;
PUBLISHED: 2009, SOURCE: 21st Internation Joint Conference on Artifical Intelligence (IJCAI-09) in 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS
INDEXED IN: Scopus WOS DBLP
IN MY: ORCID
30
TITLE: Regular encodings from Max-CSP into partial Max-SAT  Full Text
AUTHORS: Argelich, J; Cabiscol, A; Lynce, I ; Manya, F;
PUBLISHED: 2009, SOURCE: 39th International Symposium on Multiple-Valued Logic, ISMVL 2009 in Proceedings of The International Symposium on Multiple-Valued Logic
INDEXED IN: Scopus CrossRef
IN MY: ORCID
Page 3 of 7. Total results: 62.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service