Sciweavers

1960 search results - page 45 / 392
» The Logic of Large Enough
Sort
View
CADE
2008
Springer
14 years 8 months ago
Towards Fully Automated Axiom Extraction for Finite-Valued Logics
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
Dalmo Mendonca, João Marcos
ISSS
1998
IEEE
219views Hardware» more  ISSS 1998»
13 years 12 months ago
Issues in Embedded DRAM Development and Applications
After being niche markets for several years, application markets for one-chip integration of large DRAMs and logic circuits are growing very rapidly as the transition to 0.25
Doris Keitel-Schulz, Norbert Wehn
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
On the Implementation of the Probabilistic Logic Programming Language ProbLog
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have...
Angelika Kimmig, Bart Demoen, Luc De Raedt, V&iacu...
DEXAW
2007
IEEE
160views Database» more  DEXAW 2007»
14 years 2 months ago
RDF and Logic: Reasoning and Extension
In this paper we explore embeddings of the various kinds of RDF entailment in F-Logic. We show that the embeddings of simple, RDF, and RDFS entailment, as well as a large fragment...
Jos de Bruijn, Stijn Heymans
TPHOL
2007
IEEE
14 years 2 months ago
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
Lukas Bulwahn, Alexander Krauss, Tobias Nipkow