Sciweavers

382 search results - page 46 / 77
» Complexity and Expressive Power of Logic Programming
Sort
View
ICCAD
1995
IEEE
114views Hardware» more  ICCAD 1995»
13 years 11 months ago
Sequential synthesis using S1S
Abstract—We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematical...
Adnan Aziz, Felice Balarin, Robert K. Brayton, Alb...
ICFP
2008
ACM
14 years 7 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
ER
2007
Springer
130views Database» more  ER 2007»
14 years 1 months ago
Towards Automated Reasoning on ORM Schemes
The goal of this article is to formalize Object Role Modeling (ORM) using the DLR description logic. This would enable automated reasoning on the formal properties of ORM diagrams,...
Mustafa Jarrar
JMLR
2010
111views more  JMLR 2010»
13 years 2 months ago
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato,...
CIE
2009
Springer
13 years 11 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch