338 search results - page 10 / 68 » Many Facets of Complexity in Logic |
NPAR
2004
ACM
14 years 24 days ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
ISAAC
1995
Springer
13 years 11 months ago
1995
Springer
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
MPC
2010
Springer
14 years 4 days ago
2010
Springer
Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
ISMVL
1999
IEEE
13 years 11 months ago
1999
IEEE
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
IANDC
2007
13 years 7 months ago
2007
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitat...