Sciweavers

3342 search results - page 303 / 669
» Automating Abstract Interpretation
Sort
View
WWW
2008
ACM
15 years 4 months ago
Flexible Semantic-Based Service Matchmaking and Discovery
Automated techniques and tools are required to effectively locate services that fulfill a given user request in a mobility context. To this purpose, the use of semantic description...
Devis Bianchini, Valeria De Antonellis, Michele Me...
117
Voted
CL
2000
Springer
15 years 4 months ago
A New Equational Foundation for the Fluent Calculus
Abstract. A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the e...
Hans-Peter Störr, Michael Thielscher
LICS
2010
IEEE
15 years 2 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky
131
Voted
LICS
2010
IEEE
15 years 2 months ago
Breaking Paths in Atomic Flows for Classical Logic
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
Alessio Guglielmi, Tom Gundersen, Lutz Straß...
130
Voted
LPAR
2010
Springer
15 years 2 months ago
Clause Elimination Procedures for CNF Formulas
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
Marijn Heule, Matti Järvisalo, Armin Biere