Sciweavers

3994 search results - page 115 / 799
» A Linear Logical Framework
Sort
View
CADE
2012
Springer
13 years 6 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
AI
2001
Springer
15 years 8 months ago
Knowledge and Planning in an Action-Based Multi-agent Framework: A Case Study
The situation calculus is a logical formalism that has been extensively developed for planning. We apply the formalism in a complex multi-agent domain, modelled on the game of Clue...
Bradley Bart, James P. Delgrande, Oliver Schulte
TLCA
2005
Springer
15 years 9 months ago
L3: A Linear Language with Locations
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
Greg Morrisett, Amal J. Ahmed, Matthew Fluet
158
Voted
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
15 years 8 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
135
Voted
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 11 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi