From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Modeling Choices in Quasigroup Completion: SAT vs. CSP.

C. Ansótegui, A. del Val, I. Dotú, C. Fernández, и F. Manyà. AAAI, стр. 137-142. AAAI Press / The MIT Press, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

On 2-SAT and Renamable Horn.A. del Val. AAAI/IAAI, стр. 279-284. AAAI Press / The MIT Press, (2000)A New Method for Consequence Finding and Compilation in Restricted Languages.A. del Val. AAAI/IAAI, стр. 259-264. AAAI Press / The MIT Press, (1999)An Analysis of Approximate Knowledge Compilation.A. del Val. IJCAI (1), стр. 830-836. Morgan Kaufmann, (1995)Computing Knowledge Base Updates.A. del Val. KR, стр. 740-750. Morgan Kaufmann, (1992)Efficient Consequence Finding.L. Simon, и A. del Val. IJCAI, стр. 359-370. Morgan Kaufmann, (2001)Approximate Knowledge Compilation: The First Order Case.A. del Val. AAAI/IAAI, Vol. 1, стр. 498-503. AAAI Press / The MIT Press, (1996)Modeling Choices in Quasigroup Completion: SAT vs. CSP.C. Ansótegui, A. del Val, I. Dotú, C. Fernández, и F. Manyà. AAAI, стр. 137-142. AAAI Press / The MIT Press, (2004)Redundant Modeling for the QuasiGroup Completion Problem.I. Dotú, A. del Val, и M. Cebrián. CP, том 2833 из Lecture Notes in Computer Science, стр. 288-302. Springer, (2003)Tractable Databases: How to Make Propositional Unit Resolution Complete Through Compilation.A. del Val. KR, стр. 551-561. Morgan Kaufmann, (1994)Scheduling Social Tournaments.I. Dotú, A. del Val, и P. Hentenryck. CP, том 3709 из Lecture Notes in Computer Science, стр. 845. Springer, (2005)