A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Extending AI Planning to Solve more Realistic Problems
[chapter]
2008
Frontiers in Robotics, Automation and Control
Preserved Fulltext
Graphplan to solve more expressive planning problems than those that can be expressed in pure propositional STRIPS language (Fikes & Nilsson, 1971) . ...
Finally, we present some empirical results that show the effectiveness of our extensions to solve more realistic planning problems. ...
Extending AI Planning to Solve more Realistic Problems, Frontiers in Robotics, Automation and Control, Alexander Zemliak (Ed.), ISBN: 978-953-7619-17-6, InTech, Available from: http://www.intechopen.com ...
doi:10.5772/6315
fatcat:ecsdm6yi5zednjsga7jyneqlbi
GrGen: A Fast SPO-Based Graph Rewriting Tool
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We define the notion of search plans to represent different matching strategies and equip these search plans with a cost model, taking the present host graph into account. ...
For the ease of use, GrGen features an expressive specification language and generates program code with a convenient interface. ...
We thank Gergely Varró for both his most influential work on the benchmarking of graph rewrite tools as well as allowing us to reuse his measurements. ...
doi:10.1007/11841883_27
fatcat:g6rc47x2rzb3jp4lvrgzjnqaiq
Using semijoin programs to solve traversal queries in graph databases
2014
Proceedings of Workshop on GRAph Data management Experiences and Systems - GRADES'14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We study the query plans of graph queries expressed in the new algebra, and find that most graph operations can be efficiently expressed as semijoin programs. ...
The new engine combines some regular relational database operations with some extensions oriented to collection processing and complex graph queries. ...
After that, we will focus on query plan optimization for semijoin programs combined to our non-relational extensions for the resolution of complex queries over large graphs. ...
doi:10.1145/2621934.2621943
dblp:conf/sigmod/Martinez-BazanD14
fatcat:vlmg5eifqbfitl366jqrwuf75y
Handling Numeric Criteria in Relaxed Planning Graphs
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
This extension leads to more informed relaxed plans, without increasing significantly the computational cost. ...
Nowadays, one of the main techniques used in heuristic planning is the generation of a relaxed planning graph, based on a Graphplan-like expansion. ...
Nowadays, the planning community is working on extending the functionality of their planners to deal with more expressive problems. ...
doi:10.1007/978-3-540-30498-2_12
fatcat:eutyd7wi7nfwdlc2i4vjtcyyxa
Query Planning for Evaluating SPARQL Property Paths
2016
Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The extension of SPARQL in version 1.1 with property paths offers a type of regular path query for RDF graph databases. Such queries are difficult to optimize and evaluate efficiently, however. ...
We demonstrate that the plan space of Waveguide properly subsumes existing techniques and that the new plans it adds are relevant. ...
While SPARQL provides the expressiveness we desire, such queries are more challenging to optimize well. ...
doi:10.1145/2882903.2882944
dblp:conf/sigmod/YakovetsGG16
fatcat:6hiwuazlzffwdh2cyvidm2z53q
Improving Quality and Efficiency in Plan-based Neural Data-to-text Generation
2019
Proceedings of the 12th International Conference on Natural Language Generation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These extensions result in a generation process that is faster, more fluent, and more accurate. ...
We suggest four extensions to that framework: (1) we introduce a trainable neural planning component that can generate effective plans several orders of magnitude faster than the original planner; (2) ...
Conclusions We adopt the planning-based neural generation framework of Moryossef et al. (2019) and extend it to be orders of magnitude faster and produce more correct and more fluent text. ...
doi:10.18653/v1/w19-8645
dblp:conf/inlg/MoryossefGD19
fatcat:7gudhkre2vc4dj5hfe74zyvasa
Generalizing the Relaxed Planning Heuristic to Non-linear Tasks
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Subsequently, this work proposes a solid extension to the estimate that can deal with non-linear preconditions and effects. ...
While current domain description languages allow general arithmetic expressions in precondition and effect lists, the heuristic has been devised for propositional, restricted, and linear tasks only. ...
Introduction More and more successful forward-chaining planners apply variants of the relaxed planning heuristic, originally proposed by Hoffmann [22] as an extension to the estimated that was applied ...
doi:10.1007/978-3-540-30221-6_16
fatcat:yp2sefbfa5c7lnn656xcgh7ht4
Improving Quality and Efficiency in Plan-based Neural Data-to-Text Generation
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These extensions result in a generation process that is faster, more fluent, and more accurate. ...
We suggest four extensions to that framework: (1) we introduce a trainable neural planning component that can generate effective plans several orders of magnitude faster than the original planner; (2) ...
Conclusions We adopt the planning-based neural generation framework of Moryossef et al. (2019) and extend it to be orders of magnitude faster and produce more correct and more fluent text. ...
arXiv:1909.09986v1
fatcat:au7oeap2wvdzrdjhnntwsf7yge
Adaptive Extensions of Object-Oriented Systems
[chapter]
2003
IFIP Advances in Information and Communication Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper a method is described that simplifies implementing extensions of the above kind. ...
Having completed the planning step the new approach allows the user to specify the planned extension apart the existing code in one or more metaprograms 4 using AP. ...
not more expressive than doing it manually. ...
doi:10.1007/978-0-387-35672-3_9
fatcat:ogzzn3lonjfsda4y3gwntsqtxu
AAAI-10 Classic Paper Award: Systematic Nonlinear Planning A Commentary
2011
The AI Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Weld describes the two major impacts the paper had on the field of automated planning. ...
David McAllester and David Rosenblitt's paper Systematic Nonlinear Planning (published in the Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91) won the AAAI-10 classic paper ...
expressive language and was widely distributed. ...
doi:10.1609/aimag.v32i1.2341
fatcat:j3wwlnaicvg4pcpw5oss3hbtpq
Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
In the rest of this section, we describe what kinds of extensions we have made as well as our plan of future extensions. ...
In general more expressive logics require higher computational complexity. ...
doi:10.1007/978-3-540-69149-5_57
fatcat:hadfulpoaba4heq3bhfzgcqeou
RoSeS: A Continuous Content-Based Query Engine for RSS Feeds
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The contributions presented in this article are a declarative RSS feed aggregation language, an extensible stream algebra for building efficient continuous multi-query execution plans for RSS aggregation ...
views, a multi-query optimization strategy for these plans and a running prototype based on a multi-threaded asynchronous execution engine. ...
This makes it more expressive than other approaches without cost model. ...
doi:10.1007/978-3-642-23091-2_19
fatcat:ulweziahendpvof3dvxemmcmje
Compilers used in the Stratosphere Platform for Big Data Analytics
2020
International Journal of Engineering Research and
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we talk about compilers in the stack organization of the Stratosphere platform with an extensive outlook on its semantically rich operator model Sopremo and Meteor, an extensible query language ...
This makes it more expressive than writing a program in the Sopremo model as the code is no longer bound to a specific set of operators. ...
In order to improve the runtime efficiency of a compiled plan, the translation process is extended with two more steps: First, a Sopremo plan is logically optimized. ...
doi:10.17577/ijertv9is060407
fatcat:o7xiznonirhx5d6svc6ju4zqra
Applying Knowledge Graphs as Integrated Semantic Information Model for the Computerized Engineering of Building Automation Systems
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
During the life cycle of a smart building, an extensive amount of heterogeneous information is required to plan, construct, operate and maintain the building and its technical systems. ...
The knowledge graph is based on standard semantic web technologies and builds on existing ontologies, such as the Brick and QUDT ontologies, with various novel extensions presented in this paper. ...
QUDT defines an extensive list of units, quantities, dimensions and types of more than a thousand in number, and is a de-facto standard for expressing units and currencies. ...
doi:10.1007/978-3-030-49461-2_36
fatcat:5qyozh6qsfet3koaxontl5xisi
XTCcmp
2008
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
XTCcmp, the XQuery Compiler of a native XML database system, extends Starburst's well-known Query Graph Model to serve as an internal representation and basis for query restructuring of XQuery expressions ...
., simplification, algebraic rewriting, and plan generation. ...
Our intentions for plan generation were (1) to ensure that every XQGM instance can be mapped onto one or more plans; and (2) to address a large variety of evaluation algorithms in the physical algebra. ...
doi:10.14778/1454159.1454183
fatcat:7ip7jnstyrh2zed4ut4goeoj2q
« Previous
Showing results 1 — 15 out of 235,695 results