Filters








84,693 Hits in 10.1 sec

Pushing the Limits of Rule Reasoning in Transformers through Natural Language Satisfiability [article]

Kyle Richardson, Ashish Sabharwal
2021 arXiv   pre-print
We propose a new methodology for creating challenging algorithmic reasoning datasets that focus on natural language satisfiability (NLSat) problems.  ...  Recent studies have found these models to be surprisingly strong at performing deductive reasoning over formal logical theories expressed in natural language.  ...  Acknowledgments We thank the members of the Aristo team at AI2 for their feedback at various stages of this work, in particular Peter Clark and Oyvind Tafjord, as well as the Beaker team (https:// beaker.org  ... 
arXiv:2112.09054v1 fatcat:3zoxlzspbvhelh3z2oe7yuzlpi

Pushing the Limits of Rule Reasoning in Transformers through Natural Language Satisfiability

Kyle Richardson, Ashish Sabharwal
2022 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We propose a new methodology for creating challenging algorithmic reasoning datasets that focus on natural language satisfiability (NLSat) problems.  ...  Recent studies have found these models to be surprisingly strong at performing deductive reasoning over formal logical theories expressed in natural language.  ...  Acknowledgments We thank the members of the Aristo team at AI2 for their feedback at various stages of this work, in particular Peter Clark and Oyvind Tafjord, as well as the Beaker team (https:// beaker.org  ... 
doi:10.1609/aaai.v36i10.21371 fatcat:6gjitw7ynjgdbcxtscv62ithde

A Minimal Set of Refactoring Rules for Object-Z [chapter]

Tim McComb, Graeme Smith
2008 Lecture Notes in Computer Science  
This paper presents a minimal and complete set of structural refactoring rules for the Object-Z specification language that allow for the derivation of arbitrary object-oriented architectures.  ...  The rules are equivalence preserving and work in concert with existing class refinement theory, so that any design derived using the rule set can be shown to be equivalent to, or a refinement of, the original  ...  Acknowledgements We acknowledge the support of Australian Research Council (ARC) Discovery Grant DP0558408.  ... 
doi:10.1007/978-3-540-68863-1_11 fatcat:gaua45lorfefnnlrbzthjxd6fy

Processing flows of information

Gianpaolo Cugola, Alessandro Margara
2012 ACM Computing Surveys  
They differ in their system architecture, data model, rule model, and rule language.  ...  Despite these differences, DSMSs resemble DBMSs, especially in the way they process incoming data through a sequence of transformations based on common SQL operators like selections, aggregates, joins,  ...  Acknowledgments This work was partially supported by the European Commission, Programme IDEAS-ERC, Project 227977-SMScom; and by the Italian Government under the projects FIRB INSYEME and PRIN D-ASAP.  ... 
doi:10.1145/2187671.2187677 fatcat:sef24axkwfapjkffw3wegidqui

Processing flows of information

Alessandro Margara, Gianpaolo Cugola
2011 Proceedings of the 5th ACM international conference on Distributed event-based system - DEBS '11  
They differ in their system architecture, data model, rule model, and rule language.  ...  Despite these differences, DSMSs resemble DBMSs, especially in the way they process incoming data through a sequence of transformations based on common SQL operators like selections, aggregates, joins,  ...  Acknowledgments This work was partially supported by the European Commission, Programme IDEAS-ERC, Project 227977-SMScom; and by the Italian Government under the projects FIRB INSYEME and PRIN D-ASAP.  ... 
doi:10.1145/2002259.2002307 dblp:conf/debs/MargaraC11a fatcat:r5jr3rzrzjdetppugdxo3zppf4

Using Graph Transformation Systems to Specify and Verify Data Abstractions

Luciano Baresi, Carlo Ghezzi, Andrea Mocci, Mattia Monga
2009 Electronic Communications of the EASST  
in a canonical form, and the observers of the component.  ...  Graph transformation also supports the generation of behavior models that are amenable to verification.  ...  The generative nature of graph transformation provided a means to describe intensionally the (potentially infinite) behavior models of abstract data types, thus overcoming the limitations of plain finite-state  ... 
doi:10.14279/tuj.eceasst.10.155 dblp:journals/eceasst/BaresiGMM08 fatcat:sz3qygm6tzfhxmqbtp33yfrmly

Transition network grammars for natural language analysis

W. A. Woods
1970 Communications of the ACM  
The advantages of this model for natural language analysis are discussed in detail and illustrated by examples.  ...  The use of augmented transition network grammars for the analysis of natural language sentences is described.  ...  "natural" to the task of natural language analysis.  ... 
doi:10.1145/355598.362773 fatcat:rvzryhiobjhq7daodnnbefcs3y

Steps toward a model of linguistic performance: a preliminary sketch

Robert M. Schwarcz
1967 Mechanical Translation and Computational Linguistics  
The syntactic-and conceptual-data structures, inference rules, generation and understanding mechanisms, and learning mechanisms proposed for the model are all described.  ...  This paper discusses the task of formulating a model of linguistic performance and proposes an approach toward this goal that is oriented toward an embodiment of the model as a digital-computer program  ...  in the rule are satisfied for those objects.  ... 
dblp:journals/mtcl/Schwarcz67 fatcat:gbnv3sy4uncxnambb5e5jb5fhq

Push vs. Pull-Based Loop Fusion in Query Engines [article]

Amir Shaikhha, Mohammad Dashti, Christoph Koch
2016 arXiv   pre-print
In this paper, we study these two types of query engines in depth and present the limitations and advantages of each engine.  ...  Similarly, the programming languages community has developed loop fusion techniques to remove intermediate collections in the context of collection programming.  ...  However, push engines experience difficulties with limit and merge join operators. For limit operators, push engines do not allow terminating the iteration by nature.  ... 
arXiv:1610.09166v1 fatcat:2ohk4kxmyvhijkw5f4v7vc7n2y

Rule-Based Behaviour Engineering: Integrated, Intuitive Formal Rule Modelling

Lin Wah Chan, Rene Hexel, Lian Wen
2013 2013 22nd Australian Software Engineering Conference  
In a systematic way, the target model is constructed incrementally in four well-defined steps. Both the representations of rules and procedural flows are humanly readable and intuitive.  ...  We separate two concerns, rules and procedural behaviours, right at the beginning of the requirement modelling process.  ...  Comparison with Behavior Engineering The original BE method effectively transforms requirements in natural language to a formal model.  ... 
doi:10.1109/aswec.2013.13 dblp:conf/aswec/ChanHW13 fatcat:s6w7eezcwrc35eqdwokr2th6fm

Learning metamorphic malware signatures from samples

Marco Campion, Mila Dalla Preda, Roberto Giacobazzi
2021 Journal in Computer Virology and Hacking Techniques  
In this setting, the grammar recognizes the language of code variants, while the production rules model the metamorphic transformations.  ...  In particular, we formalize the language of code variants in terms of pure context-free grammars, which are similar to context-free grammars with no terminal symbols.  ...  On the time of writing this article, the following transformation rules are implemented in our tool: push Imm ; pop Reg ↔ mov Reg,Imm push Reg ; pop Reg2 ↔ mov Reg2,Reg mov Mem,Imm ; push Mem ↔ push Imm  ... 
doi:10.1007/s11416-021-00377-z fatcat:ua7rwcb4wfdcjh2ihhk22j3id4

Real-time model-driven engineering: an overview

Moussa Amrani, Pierre-Yves Schobbens
2016 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems  
Without claiming for exhaustivity, we validate our approach by analysis several contributions from the literature, thus offering an overview of the current practice in Real-Time Mde.  ...  This paper proposes three dimensions to analyse how Mde frameworks integrate time: which transformation paradigm is used, how time is represented inside it, and which characteristics of time are considered  ...  This research was sponsored by a Ceruna scholarship from the University of Namur, Belgium.  ... 
dblp:conf/models/AmraniS16 fatcat:x24iuazt7ngwzibdketqzvnv5i

A Graph-Based Approach to Transform XML Documents [chapter]

Gabriele Taentzer, Giovanni Toffetti Carughi
2006 Lecture Notes in Computer Science  
The differences to XSLT are mainly that rules can be developed visually, are more abstract (since the order of execution does not depend on the target document), IDREFs are dealt with much more naturally  ...  Nowadays XSLT is the most common language for XML transformation.  ...  It is called push because each node visited by the parser is "pushed" through the stylesheet to be caught by template rules. The output will be dictated by the source document.  ... 
doi:10.1007/11693017_6 fatcat:xpyzpkcgqzalzjav7v63fbnvre

Toward a System Design Science [chapter]

Joseph Sifakis
2014 Lecture Notes in Computer Science  
By its nature, it is a "problem-solving process". As a rule, requirements are declarative. They are usually expressed in natural languages.  ...  In pursuit of these demands, the design process moves through three stages.  ...  Peter Denning and Richard Snodgrass contributed to significantly improving the paper through constructive comments and criticism.  ... 
doi:10.1007/978-3-642-54848-2_15 fatcat:4g2ky252ezfdlihl7ig7xbteze

Understanding Ontologies in Scholarly Discipline

Brian R. Gaines
2004 International Workshop on Description Logics  
Such structures have natural representations through semantic networks that mirror the underlying description logic graph-theoretic structures and are more comprehensible than logical notations to those  ...  This article reports experience in the development of visual language tools for description logics with the objective of making research issues, past and present, more understandable. 2 Understanding an  ...  A model satisfying an ontology defined in the visual language is a collection of individuals satisfying all the existential constraints such that their resulting states are coherent.  ... 
dblp:conf/dlog/Gaines04 fatcat:phsbwwux7fhodpgp6hxkcnzpgm
« Previous Showing results 1 — 15 out of 84,693 results