João Paulo Marques da Silva


AuthID: R-000-J0P

Confirmed Publications: 271



151
TITLE: Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information
AUTHORS: Ana Graça; Inês Lynce; João Marques Silva ; Arlindo L Oliveira ;
PUBLISHED: 2010, SOURCE: Algebraic and Numeric Biology - 4th International Conference, ANB 2010, Hagenberg, Austria, July 31- August 2, 2010, Revised Selected Papers, VOLUME: 6479
INDEXED IN: DBLP Unpaywall
IN MY: DBLP
152
TITLE: Haplotype Inference by Pure Parsimony: A Survey
AUTHORS: Ana Graca; Ines Lynce ; Joao Marques Silva ; Arlindo L Oliveira ;
PUBLISHED: 2010, SOURCE: JOURNAL OF COMPUTATIONAL BIOLOGY, VOLUME: 17, ISSUE: 8
INDEXED IN: Scopus WOS DBLP CrossRef: 8
IN MY: ORCID | ResearcherID | DBLP
153
TITLE: How to Complete an Interactive Configuration Process?
AUTHORS: Mikolás Janota; Goetz Botterweck; Radu Grigore; João P Marques Silva ;
PUBLISHED: 2010, SOURCE: 36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2010 in SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings, VOLUME: 5901
INDEXED IN: Scopus DBLP CrossRef Unpaywall
IN MY: ORCID | DBLP
154
TITLE: Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking
AUTHORS: Ashish Darbari; Bernd Fischer; João Marques Silva ;
PUBLISHED: 2010, SOURCE: 7th International Colloquium on Theoretical Aspects of Computing, ICTAC 2010 in Theoretical Aspects of Computing - ICTAC 2010, 7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010. Proceedings, VOLUME: 6255
INDEXED IN: Scopus DBLP CrossRef Unpaywall
IN MY: ORCID | DBLP
155
TITLE: Minimal Unsatisfiability: Models, Algorithms & Applications
AUTHORS: Marques Silva, J ;
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
IN MY: ORCID | ResearcherID
156
TITLE: Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper)
AUTHORS: João P Marques Silva ;
PUBLISHED: 2010, SOURCE: 40th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2010, Barcelona, Spain, 26-28 May 2010
INDEXED IN: DBLP CrossRef: 28 Unpaywall
IN MY: ORCID | DBLP
157
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 | ResearcherID | DBLP
158
TITLE: Solving Linux Upgradeability Problems Using Boolean Optimization PDF
AUTHORS: Josep Argelich; Daniel Le Berre; Inês Lynce; João Marques Marques Silva ; Pascal Rapicault;
PUBLISHED: 2010, SOURCE: Proceedings First International Workshop on Logics for Component Configuration, LoCoCo 2010, Edinburgh, UK, 10th July 2010., VOLUME: 29
INDEXED IN: DBLP arXiv
IN MY: DBLP
159
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 | ResearcherID | DBLP
160
TITLE: A Lazy Unbounded Model Checker for Event-B
AUTHORS: Paulo J Matos; Bernd Fischer; João P Marques Silva ;
PUBLISHED: 2009, SOURCE: 11th International Conference on Formal Engineering Methods, ICFEM 2009 in Formal Methods and Software Engineering, 11th International Conference on Formal Engineering Methods, ICFEM 2009, Rio de Janeiro, Brazil, December 9-12, 2009. Proceedings, VOLUME: 5885
INDEXED IN: Scopus DBLP CrossRef Unpaywall
IN MY: ORCID | DBLP
Page 16 of 28. Total results: 271.

A place for researchers and their institutions

Useful Links

Get Help

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