Sciweavers

840 search results - page 58 / 168
» A low-complexity issue logic
Sort
View
96
Voted
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 17 days ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini
113
Voted
ICTIR
2009
Springer
14 years 10 months ago
Prior Information and the Determination of Event Spaces in Probabilistic Information Retrieval Models
Abstract. A mismatch between differenteventspaceshasbeen used toargue against rank equivalence of classic probabilistic models of information retrieval and language models. We ques...
Corrado Boscarino, Arjen P. de Vries
130
Voted
CADE
2001
Springer
16 years 25 days ago
A Top-Down Procedure for Disjunctive Well-Founded Semantics
Abstract. Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming i...
Kewen Wang
148
Voted
FROCOS
2009
Springer
15 years 7 months ago
Putting ABox Updates into Action
When trying to apply recently developed approaches for updating Description Logic ABoxes in the context of an action programming language, one encounters two problems. First, upda...
Conrad Drescher, Hongkai Liu, Franz Baader, Steffe...
MKM
2009
Springer
15 years 7 months ago
Combining Coq and Gappa for Certifying Floating-Point Programs
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
Sylvie Boldo, Jean-Christophe Filliâtre, Gui...