Sciweavers

56 search results - page 7 / 12
» On the Satisfiability of Two-Variable Logic over Data Words
Sort
View
JAR
2000
145views more  JAR 2000»
13 years 6 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
EMNLP
2007
13 years 8 months ago
Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
Luke S. Zettlemoyer, Michael Collins
TCS
2008
13 years 6 months ago
Absolute versus probabilistic classification in a logical setting
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
Sanjay Jain, Eric Martin, Frank Stephan
CSL
2009
Springer
14 years 1 months ago
Algorithmic Analysis of Array-Accessing Programs
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
Rajeev Alur, Pavol Cerný, Scott Weinstein
LANMR
2007
13 years 8 months ago
Dialetheic truth theory: inconsistency, non-triviality, soundness, incompleteness
The best-known application of dialetheism is to semantic paradoxes such as the Liar. In particular, Graham Priest has advocated the adoption of an axiomatic truth theory in which c...
Federico Marulanda Rey