Sciweavers

1418 search results - page 211 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
JELIA
2010
Springer
15 years 3 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
127
Voted
JSS
2010
123views more  JSS 2010»
15 years 3 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
CORR
2010
Springer
59views Education» more  CORR 2010»
15 years 3 months ago
Refinement and Verification of Real-Time Systems
This paper discusses highly general mechanisms for specifying the refinement of a real-time system as a collection of lower level parallel components that preserve the timing and ...
Paul Z. Kolano, Carlo A. Furia, Richard A. Kemmere...
ICOODB
2009
163views Database» more  ICOODB 2009»
15 years 2 months ago
Mapping XSD to OO Schemas
This paper presents algorithms that make it possible to process XML data that conforms to XML Schema (XSD) in a mainstream object-oriented programming language. These algorithms a...
Suad Alagic, Philip A. Bernstein
142
Voted
CLEIEJ
2010
15 years 2 months ago
Typing Textual Entities and M2T/T2M Transformations in a Model Management Environment
Global Model Management (GMM) is a model-based approach for managing large sets of interrelated heterogeneous and complex MDE artifacts. Such artifacts are usually represented as ...
Andrés Vignaga