Sciweavers

2573 search results - page 211 / 515
» Combinations of Modal Logics
Sort
View
BIRTHDAY
2006
Springer
15 years 10 months ago
Computational Logic in an Object-Oriented World
Logic and object-orientation (OO) are competing ways of looking at the world. Both view the world in terms of individuals. But logic focuses on the relationships between individual...
Bob Kowalski
ICCAD
2008
IEEE
117views Hardware» more  ICCAD 2008»
16 years 3 months ago
On the numbers of variables to represent sparse logic functions
— In an incompletely specified function f, don’t care values can be chosen to minimize the number of variables to represent f. It is shown that, in incompletely specified fun...
Tsutomu Sasao
EMNLP
2007
15 years 8 months ago
Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
Luke S. Zettlemoyer, Michael Collins
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 6 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
SUM
2009
Springer
16 years 1 months ago
Query Answering in Belief Logic Programming
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
Hui Wan, Michael Kifer