Paulo Moura

Paulo Moura

Auto-generated profile, based on publicly available information

Paulo Moura

University of Beira Interior & CRACS, INESC--TEC, Portugal

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 December 2007
Verified
Book Chapter
Closed access
PDF file
PMPaulo Moura
Paulo Moura
PCPaul Crocker
Paul Crocker
PNPaulo Nunes
Paulo Nunes

1 January 2009 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
PMPaulo Moura
Paulo Moura


1 October 2010
Verified
Conference Paper
Closed access
MIMichael Igler
Michael Igler
PMPaulo Moura
Paulo Moura
MZMichael Zeising
Michael Zeising
SJStefan Jablonski
Stefan Jablonski
In this paper we describe how declarative process modeling together with ontologies can be used to build complex clinical process models. Our approach supports the definition of functional, behavioral, organizational, data and operational process perspectives, resulting in an expressive and flexible modeling language. We use constraints for representing inter-process dependencies and constraint propagation for finding which processes are executable in user selected or given scenarios. Knowledge about the organizational perspective of a clinical ontology can be represented and imported from RDF files for interfacing with other applications. We implemented our approach in ESProNa, a Log talk application running on SWI-Prolog extended with the CLP(FD) constraint library and the N3 parser Henry.

21 July 2014 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
TMTheofrastos Mantadelis
Theofrastos Mantadelis
RRRicardo Rocha
Ricardo Rocha
PMPaulo Moura
Paulo Moura
Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions. Furthermore, tabling often improves computational performance. Rational term are terms with one or more infinite sub-terms but with a finite representation. Rational terms can be generated in Prolog by omitting the occurs check when unifying two terms. Applications of rational terms include definite clause grammars, constraint handling systems, and coinduction. In this paper, we report our extension of YAP's Prolog tabling mechanism to support rational terms. We describe the internal representation of rational terms within the table space and prove its correctness. We then use this extension to implement a tabling based approach to coinduction. We compare our approach with current coinductive transformations and describe the implementation. In addition, we present an algorithm that ensures a canonical representation for rational terms.

1 January 2006 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
PMPaulo Moura
Paulo Moura
VMVincent Marchetti
Vincent Marchetti