Sciweavers

507 search results - page 55 / 102
» Automating first-order relational logic
Sort
View
116
Voted
DLOG
2011
14 years 4 months ago
Extracting Finite Sets of Entailments from OWL Ontologies
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...
Samantha Bail, Bijan Parsia, Ulrike Sattler
FPGA
2005
ACM
215views FPGA» more  FPGA 2005»
15 years 6 months ago
Design, layout and verification of an FPGA using automated tools
Creating a new FPGA is a challenging undertaking because of the significant effort that must be spent on circuit design, layout and verification. It currently takes approximately ...
Ian Kuon, Aaron Egier, Jonathan Rose
LPAR
2007
Springer
15 years 6 months ago
Decidable Fragments of Many-Sorted Logic
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sa...
86
Voted
LOPSTR
1998
Springer
15 years 4 months ago
Improving Homeomorphic Embedding for Online Termination
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
Michael Leuschel
ECSQARU
2005
Springer
15 years 6 months ago
Multiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
Guilin Qi, Weiru Liu, David A. Bell