( en | de | ru )

 

Disambiguation of "Domenico, Andrea De"

Author of the publication

copydeleteadd this publication to your clipboard
A Meta-Learning Algorithm for Interrogative Agendas.

, , , and . CoRR, (2023)

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. You can also use the button next to the name to display some publications already assigned to the person.

Domenico Laurendi

Domenico Castrigiano

Domenico Lupo

Domenico Pavone

Domenico Tamburro

 

Other publications of authors with the same name

A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF., , , and . CILC, volume 2710 of CEUR Workshop Proceedings, page 214-230. CEUR-WS.org, (2020)Algorithmic correspondence and analytic rules., and . AiML, page 371-389. College Publications, (2022)The Decision Problem for Undirected Graphs with Reachability and Acyclicity., , and . CiE, volume 14773 of Lecture Notes in Computer Science, page 431-446. Springer, (2024)Description Logic for Rough Concepts., , and . IJCRS (1), volume 14839 of Lecture Notes in Computer Science, page 67-89. Springer, (2024)Labelled Calculi for Lattice-Based Modal Logics., , , , , and . ICLA, volume 13963 of Lecture Notes in Computer Science, page 23-47. Springer, (2023)Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory., , , and . CILC, volume 2396 of CEUR Workshop Proceedings, page 123-137. CEUR-WS.org, (2019)SeSaR: Security for Safety., , , , , , and . CISIS, volume 53 of Advances in Soft Computing, page 116-122. Springer, (2008)A Meta-Learning Algorithm for Interrogative Agendas., , , and . CoRR, (2023)Non-distributive Description Logic., , , , , and . TABLEAUX, volume 14278 of Lecture Notes in Computer Science, page 49-69. Springer, (2023)Labelled Calculi for the Logics of Rough Concepts., , , , , and . ICLA, volume 13963 of Lecture Notes in Computer Science, page 172-188. Springer, (2023)