Sciweavers

2920 search results - page 159 / 584
» Finite information logic
Sort
View
IANDC
2010
121views more  IANDC 2010»
15 years 3 months ago
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
The Curry-Howard correspondence connects derivations in natural deduction with the lambdacalculus. Predicates are types, derivations are terms. This supports reasoning from assump...
Murdoch James Gabbay, Dominic P. Mulligan
IJSSE
2011
127views more  IJSSE 2011»
15 years 1 months ago
A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints
The Extensible Markup Language is susceptible to security breaches because it does not incorporate methods to protect the information it encodes. Our work presented in this paper f...
Sean Policarpio, Yan Zhang
ICCAD
2002
IEEE
112views Hardware» more  ICCAD 2002»
15 years 11 months ago
ATPG-based logic synthesis: an overview
The ultimate goal of logic synthesis is to explore implementation flexibility toward meeting design targets, such as area, power, and delay. Traditionally, such flexibility is exp...
Chih-Wei Jim Chang, Malgorzata Marek-Sadowska
BIRTHDAY
2010
Springer
15 years 7 months ago
DKAL and Z3: A Logic Embedding Experiment
Yuri Gurevich and Itay Neeman proposed the Distributed Knowledge Authorization Language, DKAL, as an expressive, yet very succinctly expressible logic for distributed authorization...
Sergio Mera, Nikolaj Bjørner
ICLP
2009
Springer
16 years 7 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...