Sciweavers

3931 search results - page 130 / 787
» Separation logic and abstraction
Sort
View
LOPSTR
2004
Springer
15 years 3 months ago
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Ser...
CADE
2009
Springer
15 years 10 months ago
veriT: An Open, Trustable and Efficient SMT-Solver
Abstract. This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is open-source, proof-producing, and complete for quantifier-fr...
David Déharbe, Diego Caminha B. de Oliveira...
CADE
1994
Springer
15 years 2 months ago
PROTEIN: A PROver with a Theory Extension INterface
Abstract. PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased first order theorem prover over built-in theories. Besides various standardrefinements knownformodelelim...
Peter Baumgartner, Ulrich Furbach
BIRTHDAY
2006
Springer
15 years 1 months ago
Quantum Institutions
The exogenous approach to enriching any given base logic for probabilistic and quantum reasoning is brought into the realm of institutions. The theory of institutions helps in capt...
Carlos Caleiro, Paulo Mateus, Amílcar Serna...
DEON
2008
Springer
14 years 11 months ago
Changing Legal Systems: Abrogation and Annulment Part I: Revision of Defeasible Theories
Abstract. In this paper we investigate how to model legal abrogation and annulment in Defeasible Logic. We examine some options that embed in this setting, and similar rule-based s...
Guido Governatori, Antonino Rotolo