Sciweavers

2225 search results - page 118 / 445
» Logical Structures in the Lexicon
Sort
View
AAAI
2011
14 years 6 months ago
Abductive Markov Logic for Plan Recognition
Plan recognition is a form of abductive reasoning that involves inferring plans that best explain sets of observed actions. Most existing approaches to plan recognition and other ...
Parag Singla, Raymond J. Mooney
AGP
2003
IEEE
15 years 11 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 6 months ago
Classical BI: Its Semantics and Proof Theory
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...
James Brotherston, Cristiano Calcagno
ICFP
2012
ACM
13 years 8 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
FROCOS
2009
Springer
16 years 1 months ago
Combining Theories with Shared Set Operations
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
Thomas Wies, Ruzica Piskac, Viktor Kuncak