Sciweavers

1950 search results - page 266 / 390
» Lambda-Free Logical Frameworks
Sort
View
FLAIRS
2006
15 years 8 months ago
A Note on Comparing Semantics for Conditionals
In this paper, we will study semantics that have been used for conditionals in the area of knowledge representation and reasoning: A purely qualitative semantics based on the popu...
Christoph Beierle, Gabriele Kern-Isberner
MST
2006
120views more  MST 2006»
15 years 6 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
SYNTHESE
2008
88views more  SYNTHESE 2008»
15 years 6 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
SIGSOFT
2007
ACM
16 years 7 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
WWW
2006
ACM
16 years 7 months ago
Model-based version and configuration management for a web engineering lifecycle
During a lifecycle of a large-scale Web application, Web developers produce a wide variety of inter-related Web objects. Following good Web engineering practice, developers often ...
Tien Nhut Nguyen