Sciweavers

Share
BIRTHDAY
2006
Springer
9 years 11 months ago
Probability Theory on IF Events
Following M. Krachounov ([5]), max and min operations with fuzzy sets are considered instead of Lukasiewicz ones ([6], [7], [8], [9]). Her the domain F of a probability m : F [0, ...
Beloslav Riecan
BIRTHDAY
2006
Springer
9 years 11 months ago
Finitely Presented Abelian Lattice-Ordered Groups
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...
Andrew M. W. Glass, Françoise Point
BIRTHDAY
2006
Springer
9 years 11 months ago
Verification by Parallelization of Parametric Code
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
Tobias Gedell, Reiner Hähnle
BIRTHDAY
2006
Springer
9 years 11 months ago
Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency
Abstract. A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsi...
Arnon Avron, Anna Zamansky
BIRTHDAY
2006
Springer
9 years 11 months ago
On the Expressive Power of Live Sequence Charts
Werner Damm, Tobe Toben, Bernd Westphal
BIRTHDAY
2006
Springer
9 years 11 months ago
Best-First Rippling
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
Moa Johansson, Alan Bundy, Lucas Dixon
BIRTHDAY
2006
Springer
9 years 11 months ago
Computational Logic in an Object-Oriented World
Logic and object-orientation (OO) are competing ways of looking at the world. Both view the world in terms of individuals. But logic focuses on the relationships between individual...
Bob Kowalski
BIRTHDAY
2006
Springer
9 years 11 months ago
Reductio ad Absurdum: Planning Proofs by Contradiction
Sometimes it is pragmatically useful to prove a theorem by contradiction rather than finding a direct proof. Some reductio ad absurdum arguments have made mathematical history and ...
Erica Melis, Martin Pollet, Jörg H. Siekmann
BIRTHDAY
2006
Springer
9 years 11 months ago
Research Perspectives for Logic and Deduction
The article is meant to be kind of the author's manifesto for the role of logic and deduction within Intellectics. Based on a brief analysis of this role the paper presents a...
Wolfgang Bibel
books