Sciweavers

523 search results - page 47 / 105
» A Formal Account of WS-BPEL
Sort
View
ICFP
2005
ACM
15 years 9 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
ATAL
2010
Springer
14 years 10 months ago
A logical framework for prioritized goal change
Most previous logical accounts of goals do not deal with prioritized goals and goal dynamics properly. Many are restricted to achievement goals. In this paper, we develop a logica...
Shakil M. Khan, Yves Lespérance
ACL
1993
14 years 11 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal
AAAI
1990
14 years 11 months ago
A Circumscriptive Theory for Causal and Evidential Support
Reasoning about causality is an interesting application area of formal nonmonotonic theories. Here we focus our attention on a certain aspect of causal reasoning, namely causaZ as...
Eunok Paek
JAIR
2006
102views more  JAIR 2006»
14 years 9 months ago
Properties and Applications of Programs with Monotone and Convex Constraints
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
Lengning Liu, Miroslaw Truszczynski