Sciweavers

204 search results - page 24 / 41
» A Connection Based Proof Method for Intuitionistic Logic
Sort
View
ILP
2007
Springer
14 years 1 months ago
Learning with Kernels and Logical Representations
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
Paolo Frasconi
CADE
2011
Springer
12 years 7 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
FPGA
1992
ACM
176views FPGA» more  FPGA 1992»
13 years 11 months ago
Minimization of Permuted Reed-Muller Trees for Cellular Logic
The new family of Field Programmable Gate Arrays, CLI6000 from Concurrent Logic Inc realizes the truly Cellular Logic. It has been mainly designed for the realization of data path...
Li-Fei Wu, Marek A. Perkowski
EKAW
1999
Springer
13 years 12 months ago
Formally Verifying Dynamic Properties of Knowledge Based Systems
Abstract. In this paper we study dynamic properties of knowledge-based systems. We argue the importance of such dynamic properties for the construction and analysis of knowledge-ba...
Perry Groot, Annette ten Teije, Frank van Harmelen
AAAI
2008
13 years 10 months ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Jia-Huai You, Guohua Liu