Sciweavers

4401 search results - page 308 / 881
» Computing with Default Logic
Sort
View
ICFP
2003
ACM
16 years 6 months ago
Representing reductions of NP-complete problems in logical frameworks: a case study
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
Carsten Schürmann, Jatin Shah
ETELEMED
2009
IEEE
262views Healthcare» more  ETELEMED 2009»
16 years 1 months ago
MEDBOLI: Medical Diagnosis Based on Ontologies and Logical Inference
The Differential diagnosis (ddx) is a systematic method to identify unknowns. This method, essentially a process of elimination, is used by taxonomists to identify living organism...
Alejandro Rodríguez González, Myriam...
LICS
2007
IEEE
16 years 28 days ago
Light Logics and Optimal Reduction: Completeness and Complexity
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
AB
2007
Springer
16 years 25 days ago
Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks
Abstract. In 1973 R. Thomas introduced a logical approach to modeling and analysis of bioregulatory networks. Given a set of Boolean functions describing the regulatory interaction...
Heike Siebert, Alexander Bockmayr
CMSB
2007
Springer
16 years 25 days ago
Context Sensitivity in Logical Modeling with Time Delays
For modeling and analyzing regulatory networks based on qualitative information and possibly additional temporal constraints, approaches using hybrid automata can be very helpful. ...
Heike Siebert, Alexander Bockmayr