Sciweavers

2035 search results - page 170 / 407
» On the complexity of stratified logics
Sort
View
WISE
2002
Springer
15 years 11 months ago
Towards Declarative XML Querying
How to extract data from XML documents is an important issue for XML research and development. However, how to view XML documents determines how they can be queried. In this paper...
Mengchi Liu, Tok Wang Ling
ATAL
2010
Springer
15 years 6 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga
JSS
2010
123views more  JSS 2010»
15 years 4 months ago
Timed Property Sequence Chart
—Probabilistic properties are considered as the most important requirements for a variety of software systems, since they are used to formulate extra-functional requirements such...
Pengcheng Zhang, Bixin Li, Lars Grunske
LOGCOM
2010
120views more  LOGCOM 2010»
15 years 1 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
ICCAD
2002
IEEE
176views Hardware» more  ICCAD 2002»
16 years 3 months ago
High capacity and automatic functional extraction tool for industrial VLSI circuit designs
In this paper we present an advanced functional extraction tool for automatic generation of high-level RTL from switch-level circuit netlist representation. The tool is called FEV...
Sasha Novakovsky, Shy Shyman, Ziyad Hanna