1916 search results - page 136 / 384 » Reasoning with class algebra |
105
click to vote
CSL
2007
Springer
15 years 8 months ago
2007
Springer
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
121
click to vote
CADE
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
137
click to vote
AMAI
2005
Springer
15 years 4 months ago
2005
Springer
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about t...
177
click to vote
LICS
2012
IEEE
13 years 6 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
146
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...