Sciweavers

3044 search results - page 343 / 609
» Linear logical approximations
Sort
View
COCOON
2003
Springer
15 years 12 months ago
Petri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
Hsu-Chun Yen, Lien-Po Yu
VLSID
1997
IEEE
109views VLSI» more  VLSID 1997»
15 years 11 months ago
Delay-Insensitive Carry-Lookahead Adders
Integer addition is one of the most important operations in digital computer systems because the performance of processors is significantly influenced by the speed of their adde...
Fu-Chiung Cheng, Stephen H. Unger, Michael Theobal...
TIME
1994
IEEE
15 years 10 months ago
Hypothetical Reasoning from Situation Calculus to Event Calculus
Pinto and Reiter have argued that the Situation Calculus, improved with time handling axioms, subsumes the features of linear time temporal formalisms such as Event Calculus and I...
Alessandro Provetti
ECTEL
2007
Springer
15 years 10 months ago
Curriculum Model Checking: Declarative Representation and Verification of Properties
When a curriculum is proposed, it is important to verify at least three aspects: that the curriculum allows the achievement of the user's learning goals, that the curriculum i...
Matteo Baldoni, Elisa Marengo
COLING
2000
15 years 8 months ago
Generation, Lambek Calculus, Montague's Semantics and Semantic Proof Nets
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...
Sylvain Pogodalla