71
TÍTULO: QBF-Based Boolean Function Bi-Decomposition
AUTORES: Chen, H; Janota, M; Marques Silva, J ;
PUBLICAÇÃO: 2012, FONTE: Design, Automation and Test in Europe Conference and Exhibition (DATE) in DESIGN, AUTOMATION & TEST IN EUROPE (DATE 2012)
INDEXADO EM: WOS DBLP
NO MEU: ORCID
72
TÍTULO: PackUp: Tools for Package Upgradability Solving PDF
AUTORES: Mikolás Janota; Inês Lynce; Vasco M. Manquinho; João Marques Silva ;
PUBLICAÇÃO: 2012, FONTE: JSAT, VOLUME: 8, NÚMERO: 1/2
INDEXADO EM: DBLP
73
TÍTULO: QBf-based boolean function bi-decomposition
AUTORES: Huan Chen; Janota, M; Marques-Silva, J;
PUBLICAÇÃO: 2012, FONTE: 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE)
INDEXADO EM: CrossRef
NO MEU: ORCID
74
TÍTULO: cmMUS: A Tool for Circumscription-Based MUS Membership Testing  Full Text
AUTORES: Janota, M; Marques Silva, J ;
PUBLICAÇÃO: 2011, FONTE: 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) in LOGIC PROGRAMMING AND NONMONOTONIC REASONING, VOLUME: 6645
INDEXADO EM: Scopus WOS DBLP CrossRef Unpaywall
NO MEU: ORCID
75
TÍTULO: Abstraction-Based Algorithm for 2QBF
AUTORES: Janota, M; Marques Silva, J ;
PUBLICAÇÃO: 2011, FONTE: 14th International Conference on Theory and Applications of Satisfiability Testing (SAT) in THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2011, VOLUME: 6695
INDEXADO EM: Scopus WOS DBLP CrossRef Unpaywall
NO MEU: ORCID
76
TÍTULO: On Deciding MUS Membership with QBF
AUTORES: Mikolás Janota; João P Marques Silva ;
PUBLICAÇÃO: 2011, FONTE: 17th International Conference on Principles and Practice of Constraint Programming, CP 2011 in Principles and Practice of Constraint Programming - CP 2011 - 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings, VOLUME: 6876
INDEXADO EM: Scopus DBLP CrossRef Unpaywall
NO MEU: ORCID
77
TÍTULO: Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
AUTORES: Mikolas Janota; Radu Grigore; Joao Marques Silva ;
PUBLICAÇÃO: 2010, FONTE: 12th European Conference on Logics in Artificial Intelligence (JELIA) in LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2010, VOLUME: 6341
INDEXADO EM: Scopus WOS DBLP CrossRef Unpaywall
NO MEU: ORCID
78
TÍTULO: On Computing Backbones of Propositional Theories
AUTORES: Joao Marques Silva ; Mikolas Janota; Ines Lynce ;
PUBLICAÇÃO: 2010, FONTE: 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
INDEXADO EM: Scopus WOS DBLP
NO MEU: ORCID
79
TÍTULO: How to Complete an Interactive Configuration Process?
AUTORES: Mikolás Janota; Goetz Botterweck; Radu Grigore; João P Marques Silva ;
PUBLICAÇÃO: 2010, FONTE: 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
INDEXADO EM: Scopus DBLP CrossRef Unpaywall
NO MEU: ORCID
80
TÍTULO: Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription PDF
AUTORES: Mikolás Janota; João Marques Silva; Radu Grigore;
PUBLICAÇÃO: 2010, FONTE: CoRR, VOLUME: abs/1006.5896
INDEXADO EM: DBLP arXiv
Página 8 de 10. Total de resultados: 97.