1679 search results - page 18 / 336 » Strong order equivalence |
115
click to vote
ASP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
ICALP
1998
Springer
15 years 4 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
168
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
Lazy replication is a popular technique for improving the performance and availability of database systems. Although there are concurrency control techniques which guarantee seria...
DM
2008
14 years 12 months ago
2008
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,
AML
2002
14 years 11 months ago
2002
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.