( en | de | ru )

 

Disambiguation of "Martelli, Alberto"

Author of the publication

copydeleteadd this publication to your clipboard
Reasoning about actions with EL ontologies with temporal answer sets.

, , and . CoRR, (2021)

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.

Alessandro Martelli

Bettina Martelli

Faustino Martelli

Stefano Martelli

Chiara Martelli

 

Other publications of authors with the same name

Verifying Communicating Agents by Model Checking in a Temporal Action Logic., , and . JELIA, volume 3229 of Lecture Notes in Computer Science, page 57-69. Springer, (2004)Efficient Unificatioin with Infinite Terms in Logic Programming., and . FGCS, page 202-209. OHMSHA Ltd. Tokyo and North-Holland, (1984)Personalization, Verification and Conformance for Logic-based Communicating Agents., , , , , , and . WOA, page 177-183. Pitagora Editrice Bologna, (2005)Extending Negation As Failure by Abduction: A Three-Valued Stable Model Semantics., , and . J. Log. Program., 26 (1): 31-67 (1996)Reasoning about interaction protocols for customizing web service selection and composition., , , and . J. Log. Algebraic Methods Program., 70 (1): 53-73 (2007)Dynamic Programming as Graph Searching: An Algebraic Approach., , and . J. ACM, 28 (4): 737-751 (1981)Reasoning about Self and Others: Communicating Agents in a Model Action Logic., , , and . ICTCS, volume 2841 of Lecture Notes in Computer Science, page 228-241. Springer, (2003)Translating a Modal Language with Embedded Implication into Horn Clause Logic., , and . ELP, volume 1050 of Lecture Notes in Computer Science, page 19-33. Springer, (1996)Negation as Failure and Constraints through Abduction and Defaults., , and . AI*IA, volume 549 of Lecture Notes in Computer Science, page 78-87. Springer, (1991)Edge detection using heuristic search methods.. Comput. Graph. Image Process., 1 (2): 169-182 (1972)