Sciweavers

650 search results - page 96 / 130
» Logical Bisimulations and Functional Languages
Sort
View
JELIA
2010
Springer
13 years 6 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, ...
SOFSEM
2009
Springer
14 years 4 months ago
Expressiveness of Multiple Heads in CHR
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...
Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiar...
DBPL
1997
Springer
94views Database» more  DBPL 1997»
13 years 12 months ago
Querying Multidimensional Databases
Abstract. Multidimensional databases are large collections of data, often historical, used for sophisticated analysis oriented to decision making. This activity is supported by an ...
Luca Cabibbo, Riccardo Torlone
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 1 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
ICLP
2007
Springer
14 years 1 months ago
Static Region Analysis for Mercury
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...
Quan Phan, Gerda Janssens