Sciweavers

1549 search results - page 142 / 310
» On the rules of intermediate logics
Sort
View
TLCA
1999
Springer
14 years 1 months ago
Strong Normalisation of Cut-Elimination in Classical Logic
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
Christian Urban, Gavin M. Bierman
AAAI
2008
13 years 11 months ago
Revising Imprecise Probabilistic Beliefs in the Framework of Probabilistic Logic Programming
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base whi...
Anbu Yue, Weiru Liu
CSL
2008
Springer
13 years 11 months ago
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Ian Hodkinson, Angelo Montanari, Guido Sciavicco
FPL
2008
Springer
141views Hardware» more  FPL 2008»
13 years 10 months ago
An analytical model describing the relationships between logic architecture and FPGA density
This paper describes an analytical model, based principally on Rent's Rule, that relates logic architectural parameters to the area efficiency of an FPGA. In particular, the ...
Andrew Lam, Steven J. E. Wilton, Philip Heng Wai L...
DAGSTUHL
2003
13 years 10 months ago
Logical Languages for Data Mining
Data mining focuses on the development of methods and algorithms for such tasks as classification, clustering, rule induction, and discovery of associations. In the database fiel...
Fosca Giannotti, Giuseppe Manco, Jef Wijsen