Sciweavers

4066 search results - page 27 / 814
» Almost Complete Sets
Sort
View
DALT
2005
Springer
14 years 1 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
CPC
2004
92views more  CPC 2004»
13 years 7 months ago
Large Topological Cliques in Graphs Without a 4-Cycle
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...
Daniela Kühn, Deryk Osthus
STACS
2009
Springer
14 years 2 months ago
Forward Analysis for WSTS, Part I: Completions
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
Alain Finkel, Jean Goubault-Larrecq
DAGSTUHL
2008
13 years 9 months ago
Complete Interval Arithmetic and its Implementation
: Let IIR be the set of closed and bounded intervals of real numbers. Arithmetic in IIR can be defined via the power set IPIR of real numbers. If divisors containing zero are exclu...
Ulrich W. Kulisch
JSC
2010
82views more  JSC 2010»
13 years 2 months ago
Linear complete differential resultants and the implicitization of linear DPPEs
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
Sonia L. Rueda, J. Rafael Sendra