Sciweavers

271 search results - page 8 / 55
» Logics from Galois connections
Sort
View
CIE
2007
Springer
14 years 4 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
JELIA
2010
Springer
13 years 8 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
IJCAI
2007
13 years 11 months ago
Coalitions in Action Logic
If modal logics for coalitions need to be applied, one must know how to translate coalition power into agents’ actions. To these days, the connection between coalition power and...
Stefano Borgo
CHARME
1999
Springer
100views Hardware» more  CHARME 1999»
14 years 2 months ago
Xs are for Trajectory Evaluation, Booleans are for Theorem Proving
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
Mark Aagaard, Thomas F. Melham, John W. O'Leary
ICFP
2010
ACM
13 years 10 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic