Search the dblp DataBase
Luca Anselma :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Luca Anselma , Diego Magro , Pietro Torasso Automatically Decomposing Configuration Problems. [Citation Graph (0, 0)][DBLP ] AI*IA, 2003, pp:39-52 [Conf ] Paolo Terenziani , Luca Anselma , Stefania Montani Periodicity-Based Temporal Constraints. [Citation Graph (0, 0)][DBLP ] AI*IA, 2005, pp:62-65 [Conf ] Paolo Terenziani , Stefania Montani , Alessio Bottrighi , Mauro Torchio , Gianpaolo Molino , Luca Anselma , Gianluca Correndo Applying Artificial Intelligence to Clinical Guidelines: The GLARE Approach. [Citation Graph (0, 0)][DBLP ] AI*IA, 2003, pp:536-547 [Conf ] Luca Anselma Recursive Representation of Periodicity and Temporal Reasoning. [Citation Graph (0, 0)][DBLP ] TIME, 2004, pp:52-59 [Conf ] Paolo Terenziani , Luca Anselma Towards a Temporal Reasoning Approach Dealing with Instance-of, Part-of and Periodicity. [Citation Graph (0, 0)][DBLP ] TIME, 2003, pp:37-46 [Conf ] Luca Anselma , Paolo Terenziani , Stefania Montani , Alessio Bottrighi Towards a comprehensive treatment of repetitions, periodicity and temporal constraints in clinical guidelines. [Citation Graph (0, 0)][DBLP ] Artificial Intelligence in Medicine, 2006, v:38, n:2, pp:171-195 [Journal ] Paolo Terenziani , Luca Anselma A knowledge server for reasoning about temporal constraints between classes and instances of events. [Citation Graph (0, 0)][DBLP ] Int. J. Intell. Syst., 2004, v:19, n:10, pp:919-947 [Journal ] Paolo Terenziani , Luca Anselma Temporal reasoning about composite and/or periodic events. [Citation Graph (0, 0)][DBLP ] J. Exp. Theor. Artif. Intell., 2006, v:18, n:1, pp:87-115 [Journal ] Cost-sensitive Iterative Abductive Reasoning with abstractions. [Citation Graph (, )][DBLP ] Automatic Treatment of Temporal Issues in Clinical Guidelines in the GLARE System. [Citation Graph (, )][DBLP ] Automatic Checking of the Correctness of Clinical Guidelines in GLARE. [Citation Graph (, )][DBLP ] Search in 0.001secs, Finished in 0.002secs