4401 search results - page 437 / 881 » Computing with Default Logic |
188
click to vote
BIRTHDAY
1997
Springer
15 years 11 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
182
click to vote
ICPADS
1996
IEEE
15 years 11 months ago
1996
IEEE
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
193
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
We develop an accurate, unified treatment of elastica. Following the method of resultant-based formulation to its logical extreme, we derive a higher-order integration rule, or el...
152
click to vote
PARLE
1992
15 years 11 months ago
1992
We compare di erent degrees of architecture abstraction and communication reliability in distributed programming languages. A nearly architecture independent logic programming lang...
148
click to vote
CONCUR
1990
Springer
15 years 11 months ago
1990
Springer
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...