Sciweavers

174 search results - page 26 / 35
» Existential Fixed-Point Logic
Sort
View
130
Voted
VLC
2011
83views more  VLC 2011»
14 years 10 months ago
A decision procedure for a decidable fragment of generalized constraint diagrams
Constraint diagrams were introduced by Kent, in 1997, as an alternative to the OCL for placing formal constraints on software models. Since their introduction, constraint diagrams...
Jim Burton, Gem Stapleton, Ali Hamie
IJCAI
2001
15 years 5 months ago
Backjumping for Quantified Boolean Logic Satisfiability
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
120
Voted
JANCL
2008
170views more  JANCL 2008»
15 years 3 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
145
Voted
ASAP
2008
IEEE
146views Hardware» more  ASAP 2008»
15 years 10 months ago
A multi-FPGA application-specific architecture for accelerating a floating point Fourier Integral Operator
Many complex systems require the use of floating point arithmetic that is exceedingly time consuming to perform on personal computers. However, floating point operators are also h...
Jason Lee, Lesley Shannon, Matthew J. Yedlin, Gary...
132
Voted
FLOPS
2008
Springer
15 years 5 months ago
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
Susana Nieva, Jaime Sánchez-Hernánde...