Sciweavers

680 search results - page 45 / 136
» Complexity of Strict Implication
Sort
View
LORI
2009
Springer
14 years 8 days ago
Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences All Together
We present in this work a sound and complete modal logic called EDLA (Epistemic Dynamic Logic of Agency) integrating the concepts of joint action, preference and knowledge and ena...
Emiliano Lorini, François Schwarzentruber, ...
ECAL
2001
Springer
14 years 6 days ago
Evolving Multi-agent Networks in Structured Environments
A crucial feature of evolving natural systems is parallelism. The simultaneous and distributed application of rules (governed by e.g. biochemistry) is generally considered as the p...
Thomas Glotzmann, Holger Lange, Michael Hauhs, A. ...
PEPM
1994
ACM
13 years 11 months ago
PERs from Projections for Binding-Time Analysis
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
Kei Davis
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
13 years 11 months ago
A Duality between Clause Width and Clause Density for SAT
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
Chris Calabro, Russell Impagliazzo, Ramamohan Patu...
ICAT
2007
IEEE
13 years 9 months ago
New Tetrahedral Mesh Generation Method based on Delaunay Criteria and Space Disassembling
The requirement of tetrahedral mesh generation algorithm, which is a prerequisite of many soft tissue simulation methods, becomes very strict because of the real-time requirement ...
Xiao Yu, Weitao Chen, Pengfei Huang, Sizhe Lv, Lix...