Sciweavers

1269 search results - page 121 / 254
» Pi-Calculus in Logical Form
Sort
View
CP
2010
Springer
14 years 10 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin
97
Voted
IJDAR
2006
103views more  IJDAR 2006»
15 years 22 days ago
Table-processing paradigms: a research survey
Tables are a ubiquitous form of communication. While everyone seems to know what a table is, a precise, analytical definition of "tabularity" remains elusive because some...
David W. Embley, Matthew Hurst, Daniel P. Lopresti...
118
Voted
PKDD
2009
Springer
170views Data Mining» more  PKDD 2009»
15 years 7 months ago
Statistical Relational Learning with Formal Ontologies
Abstract. We propose a learning approach for integrating formal knowledge into statistical inference by exploiting ontologies as a semantically rich and fully formal representation...
Achim Rettinger, Matthias Nickles, Volker Tresp
99
Voted
PPDP
2009
Springer
15 years 7 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
DSD
2007
IEEE
83views Hardware» more  DSD 2007»
15 years 7 months ago
Hierarchical Identification of Untestable Faults in Sequential Circuits
Similar to sequential test pattern generation, the problem of identifying untestable faults in sequential circuits remains unsolved. Most of the previous works in untestability id...
Jaan Raik, Raimund Ubar, Anna Krivenko, Margus Kru...