• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 863
Next 10 →

Look-back Techniques for ASP Programs with Aggregates

by Wolfgang Faber, Nicola Leone, Marco Maratea, Francesco Ricca
"... One of the most significant language extensions to Answer Set Programming (ASP) has been the introduction of aggregates. A significant amount of theoretical and practical work on aggregates in ASP has been published in recent years. In spite of these developments, aggregates are treated in a quite s ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
straightforward and ad-hoc way in most ASP systems. For the system DLV, several specialized techniques for aggregates have been described in [6], however still leaving a lot of room for improvement. In this paper, we build upon work on look-back optimization techniques done recently for DLV, and extend its reason

IOS Press Look-back Techniques for ASP Programs with Aggregates ∗

by Wolfgang Faber, Nicola Leone C, Marco Maratea, Francesco Ricca
"... Abstract. The introduction of aggregates has been one of the most relevant language extensions to Answer Set Programming (ASP). Aggregates are very expressive, they allow to represent many problems in a more succinct and elegant way compared to aggregate-free programs. A significant amount of resear ..."
Abstract - Add to MetaCart
techniques for an efficient implementation of aggregates. We define a reason calculus for backjumping in ASP programs with aggregates. Furthermore, we describe how these reasons can be used in order to guide look-back heuristics for programs with aggregates. We have implemented both the new reason calculus

Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals

by Jim Gray, Adam Bosworth, Andrew Layman, Don Reichart, Hamid Pirahesh , 1996
"... Abstract. Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zero-dimensional or one-dimensional aggregates. Applications need the N-dimensional generalization of these op ..."
Abstract - Cited by 860 (11 self) - Add to MetaCart
Abstract. Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zero-dimensional or one-dimensional aggregates. Applications need the N-dimensional generalization

Look-Back Techniques and Heuristics in DLV: Implementation and Evaluation ⋆

by Wolfgang Faber , Nicola Leone , Marco Maratea , Francesco Ricca
"... Abstract. Answer Set Programming (ASP) is a purely-declarative programming paradigm based on logic rules, allowing for both disjunction in the head of the rules and nonmonotonic negation in the body. ASP can express any property whose complexity is in the second level of the polynomial hierarchy, t ..."
Abstract - Add to MetaCart
recently, DLV did not incorporate any "backjumping" techniques (neither did other disjunctive ASP systems). Related, DLV could not use "look-back" information accumulated for backjumping in its heuristics, which have been shown in related research areas to be crucial on large benchmarks

The Determinants of Credit Spread Changes.

by Pierre Collin-Dufresne , Robert S Goldstein , J Spencer Martin , Gurdip Bakshi , Greg Bauer , Dave Brown , Francesca Carrieri , Peter Christoffersen , Susan Christoffersen , Greg Duffee , Darrell Duffie , Vihang Errunza , Gifford Fong , Mike Gallmeyer , Laurent Gauthier , Rick Green , John Griffin , Jean Helwege , Kris Jacobs , Chris Jones , Andrew Karolyi , Dilip Madan , David Mauer , Erwan Morellec , Federico Nardari , N R Prabhala , Tony Sanders , Sergei Sarkissian , Bill Schwert , Ken Singleton , Chester Spatt , René Stulz - Journal of Finance , 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract - Cited by 422 (2 self) - Add to MetaCart
, and Southern Methodist University. The relation between stock and bond returns has been widely studied at the aggregate level (see, for example, Campbell and Ammer (1993), Keim and Stambaugh (1986), Fama and French (1989), and Fama and French (1993)). Recently, a few studies have investigated that relation

Experimenting with look-back heuristics for hard ASP programs

by Wolfgang Faber , Nicola Leone , Marco Maratea , Francesco Ricca - Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’07 , 2007
"... Abstract. Competitive native solvers for Answer Set Programming (ASP) perform a backtracking search by assuming the truth of literals. The choice of literals (the heuristic) is fundamental for the performance of these systems. Most of the efficient ASP systems employ a heuristic based on look-ahead ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
this approach to the framework of disjunctive ASP. We design a number of look-back heuristics exploiting peculiarities of ASP and implement them in the ASP system DLV. We compare their performance on a collection of hard ASP programs both structured and randomly generated. These experiments indicate that a very

Interpreting the data: Parallel analysis with Sawzall.

by Rob Pike , Sean Dorward , Robert Griesemer , Sean Quinlan - Scientific Programming Journal, , 2005
"... Abstract Very large data sets often have a flat but regular structure and span multiple disks and machines. Examples include telephone call records, network logs, and web document repositories. These large data sets are not amenable to study using traditional database techniques, if only because th ..."
Abstract - Cited by 273 (0 self) - Add to MetaCart
, in which a query is expressed using a new procedural programming language, emits data to an aggregation phase. Both phases are distributed over hundreds or even thousands of computers. The results are then collated and saved to a file. The design -including the separation into two phases, the form

Conflict-driven answer set solving

by Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub - in Proceedings IJCAI’07 , 2007
"... We introduce a new approach to computing answer sets of logic programs, based on concepts from constraint processing (CSP) and satisfiability checking (SAT). The idea is to view inferences in answer set programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraintbased ..."
Abstract - Cited by 201 (48 self) - Add to MetaCart
We introduce a new approach to computing answer sets of logic programs, based on concepts from constraint processing (CSP) and satisfiability checking (SAT). The idea is to view inferences in answer set programming (ASP) as unit propagation on nogoods. This provides us with a uniform

Stochastic Dynamic Programming with Factored Representations

by Craig Boutilier, Richard Dearden, Moisés Goldszmidt , 1997
"... Markov decision processes(MDPs) have proven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, state-based specifications and computations. To alleviate the combinatorial problems associated with such methods, we pro-p ..."
Abstract - Cited by 189 (10 self) - Add to MetaCart
decision-tree representation of rewards. Based on this representation, we develop versions of standard dynamic programming algorithms that directly manipulate decision-tree representations of policies and value functions. This generally obviates the need for state-by-state computation, aggregating states

Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity

by Wolfgang Faber, Nicola Leone, Gerald Pfeifer - In Proceedings of European Conference on Logics in Artificial Intelligence (JELIA , 2004
"... Abstract. The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP). They strengthen the modeling power of ASP, in terms of concise problem representations. While many important problems can be encoded using nonrecursive aggregates, som ..."
Abstract - Cited by 115 (15 self) - Add to MetaCart
Abstract. The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP). They strengthen the modeling power of ASP, in terms of concise problem representations. While many important problems can be encoded using nonrecursive aggregates
Next 10 →
Results 1 - 10 of 863
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University