73 search results - page 6 / 15 » On the Automatizability of Polynomial Calculus |
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
LOGCOM
2010
13 years 6 months ago
2010
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In thi...
IJCAI
1993
13 years 8 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...
PODS
2010
ACM
14 years 18 days ago
2010
ACM
This paper approaches the incremental view maintenance problem from an algebraic perspective. We construct a ring of databases and use it as the foundation of the design of a quer...
CONCUR
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. The ambient calculus is a calculus of computation that allows active processes (mobile ambients) to move between sites. A firewall is said to be protective whenever it d...