Sciweavers

3044 search results - page 85 / 609
» Linear logical approximations
Sort
View
LOGCOM
2010
135views more  LOGCOM 2010»
13 years 7 months ago
Bases of Admissible Rules of Lukasiewicz Logic
We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Lukasiewicz logic, and we prove that every formula has an admissibly sat...
Emil Jerábek
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
13 years 6 months ago
Temporal logic control of discrete-time piecewise affine systems
Abstract-- We consider the problem of controlling a discretetime piecewise affine (PWA) system from a specification given as a Linear Temporal Logic (LTL) formula over linear predi...
Boyan Yordanov, Calin Belta
CADE
1992
Springer
14 years 1 months ago
Linear-Input Subset Analysis
There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are ...
Geoff Sutcliffe
JSC
2006
147views more  JSC 2006»
13 years 8 months ago
An algorithm to solve integer linear systems exactly using numerical methods
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
Zhendong Wan
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
14 years 1 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert