Sciweavers

5378 search results - page 251 / 1076
» Base Logics in Argumentation
Sort
View
IJCAI
2007
15 years 8 months ago
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov l...
Daniel Lowd, Pedro Domingos
FUIN
2008
116views more  FUIN 2008»
15 years 6 months ago
On the Relationship between Description Logic-based and F-Logic-based Ontologies
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...
Jos de Bruijn, Stijn Heymans
APLAS
2010
ACM
15 years 7 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
NDJFL
2000
74views more  NDJFL 2000»
15 years 6 months ago
Frege's New Science
In this paper, we explore Fregean metatheory, what Frege called the New Science. The New Science arises in the context of Frege's debate with Hilbert over independence proofs ...
Aldo Antonelli, Robert May
FPGA
2010
ACM
276views FPGA» more  FPGA 2010»
16 years 3 months ago
Accelerating Monte Carlo based SSTA using FPGA
Monte Carlo based SSTA serves as the golden standard against alternative SSTA algorithms, but it is seldom used in practice due to its high computation time. In this paper, we acc...
Jason Cong, Karthik Gururaj, Wei Jiang, Bin Liu, K...