Sciweavers

2514 search results - page 321 / 503
» The use of industrial-strength formal methods
Sort
View
FUIN
2007
90views more  FUIN 2007»
15 years 6 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
IJKL
2007
90views more  IJKL 2007»
15 years 6 months ago
Semantics-supported cooperative learning for enhanced awareness
: Awareness is required for supporting all forms of cooperation. In Computer Supported Collaborative Learning (CSCL), awareness can be used for enhancing collaborative opportunitie...
César A. Collazos, Roberto Garcia
CI
2002
112views more  CI 2002»
15 years 6 months ago
Negotiating the Semantics of Agent Communication Languages
This paper presents a formal framework and outlines a method that autonomous agents can use to negotiate the semantics of their communication language at run-time. Such an ability...
Chris Reed, Timothy J. Norman, Nicholas R. Jenning...
PKDD
2010
Springer
193views Data Mining» more  PKDD 2010»
15 years 4 months ago
Process Mining Meets Abstract Interpretation
Mining Meets Abstract Interpretation J. Carmona and J. Cortadella Universitat Polit`ecnica de Catalunya, Spain The discovery of process models out of system traces is a problem tha...
Josep Carmona, Jordi Cortadella
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 4 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...