Sciweavers

393 search results - page 74 / 79
» Logic Programs with Classical Negation
Sort
View
LICS
2007
IEEE
14 years 2 months ago
A Dependent Set Theory
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
Wojciech Moczydlowski
ICISS
2010
Springer
13 years 6 months ago
ValueGuard: Protection of Native Applications against Data-Only Buffer Overflows
Abstract. Code injection attacks that target the control-data of an application have been prevalent amongst exploit writers for over 20 years. Today however, these attacks are gett...
Steven Van Acker, Nick Nikiforakis, Pieter Philipp...
CSCLP
2008
Springer
13 years 10 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 8 months ago
Pivotal and Pivotal-discriminative Consequence Relations
In the present paper, we investigate consequence relations that are both paraconsistent and plausible (but still monotonic). More precisely, we put the focus on pivotal consequenc...
Jonathan Ben-Naim
BMCBI
2005
116views more  BMCBI 2005»
13 years 8 months ago
Which gene did you mean?
Computational Biology needs computer-readable information records. Increasingly, meta-analysed and pre-digested information is being used in the follow up of high throughput exper...
Barend Mons