11,021 Hits in 5.8 sec

Interactive proof checking

Thomas Reps, Bowen Alpern
1984 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84  
Knowledge of logical inference rules shows s specialised proof editor to provide a user with feedback about errors in s proof under development.  ...  This paper discusses how sun attribute graanm~r can be used in an editor for pactialcorrectness program proofs in Hosts-style lo~c, where verification condition• ace proved using the sequent calculus.  ...  Acknowledgements We were stimulated to write this discussion of our work on interactive proof checking aider receiving encouragement from a number of people who had seen the prototype proof-checking editor  ... 
doi:10.1145/800017.800514 dblp:conf/popl/RepsA84 fatcat:ensoq7fiwnc6rnwiltxfphsndi

Irregular lattices for complex shape grammar facade parsing

H. Riemenschneider, U. Krispel, W. Thaller, M. Donoser, S. Havemann, D. Fellner, H. Bischof
2012 2012 IEEE Conference on Computer Vision and Pattern Recognition  
Usually inference uses numerical approximations, or hard-coded grammar schemes.  ...  Shape grammars are an established method to express hierarchical spatial relationships, and are therefore suited as representing constraints for semantic facade interpretation.  ...  to Images and derived Textured Point Clouds), grant number 815971/14472.  ... 
doi:10.1109/cvpr.2012.6247857 dblp:conf/cvpr/RiemenschneiderKTDHFB12 fatcat:lacivmqdyzc5hihxcaszlcaa74

A truly generative semantics-directed compiler generator

Harald Ganzinger, Robert Giegerich, Ulrich Möncke, Reinhard Wilhelm
1982 Proceedings of the 1982 SIGPLAN symposium on Compiler construction - SIGPLAN '82  
Traditionally two views of what an attribute grammar specifies are in use. The first considers an attribute grammar to specify the decoration of parse trees with the values of the attributes.  ...  They represent sets of templates and subtemplates that have been recognized as (partially) matching the [Kro75] (which MUG2 uses) leads to an S-attributed grammar, using only synthesized attributes  ...  .: Computation and use of data flow information in optimizing compilers. ~cta Informatiea 12 (1979), 209-225.  ... 
doi:10.1145/800230.806993 dblp:conf/sigplan/GanzingerGMW82 fatcat:ws4ifdyjnfe3tep5tgjgngj5ra

Page 6062 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
Wiestaw Zielonka (F-PARIS7-FA; Paris) 2002h:68117 68Q45 68Q60 68T0S Zyada, Szilvia (H-SZEG-RAI; Szeged); Gyimothy, Tibor (H-SZEG-RAI; Szeged) Using decision trees to infer semantic functions of attribute  ...  Summary: “In this paper we present a learning method called LAG (learning of attribute grammar) which infers semantic functions for simple classes of attribute grammars by means of examples and background  ... 

Generalising Tree Traversals to DAGs

Patrick Bahr, Emil Axelsson
2015 Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation - PEPM '15  
We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs.  ...  Our recursion scheme allows the programmer to implement a tree traversal and then apply it to compact graph representations of trees instead.  ...  Combining Semantic Functions to Attribute Grammars Now that we have Haskell representations for semantic functions, we need combinators that allow us to combine them to form complete AGs.  ... 
doi:10.1145/2678015.2682539 dblp:conf/pepm/BahrA15 fatcat:rbdztkdunzdevadpfaruxnogdm

Graph Object Oriented Database for Semantic Image Retrieval [chapter]

Eugen Ganea, Marius Brezovan
2010 Lecture Notes in Computer Science  
A graph structure is used in all phases of the image processing: image segmentation, image annotation, image indexing and image retrieval.  ...  This paper presents a new method for image retrieval using a graph object oriented database for processing the information extracted from the image through the segmentation process and through the semantic  ...  For annotate the simple objects we used learning algorithms based on decision trees -Decision Tree based Semantic Templates algorithm (DT-ST) [15] .  ... 
doi:10.1007/978-3-642-15576-5_46 fatcat:qmhn7hdbsjhvpf4we5r7z42zje

Cumulative subject index

1978 Information and Control  
. , bounding, simple solution to lack of exact a priori statistics, 39, 2t2 Finite automata with cost functions, 37, 40 decomposition of, 38, 288 index ETOL systems of, 38, 103 grammars, family  ...  methodology capabilities and limitations, 39, 272 semantic preserving translations, 39, 247 semantic-syntax directed, 36, 320 Tree automata, context-dependent, 38, 81 languages, tree transducers  ... 
doi:10.1016/s0019-9958(78)90707-6 fatcat:3g6qa5hi2zc2lgyyvndbar65di

Research on Analytic Algorithm of Building Structure Appearance Based on Improved Learning Grammar

Kassa Anani Thierry, Gao Bao Lu
2019 International Journal of Advanced Engineering Research and Science  
The main purpose of this paper is to improve learning grammar used for building's façade segmentation.  ...  The second layer consist to learn automatically an inferred grammar.  ...  This segmentation is formulated in term of Markov Decision process (MDP) using shape grammar convention.  ... 
doi:10.22161/ijaers.610.30 fatcat:4bhtfksow5aado34csz2bpm4n4

A Contrastive Evaluation of Functional Unification Grammar for Surface Language Generation: A Case Study in Choice of Connectives [chapter]

Kathleen R. McKeown, Michael Elhadad
1991 The Kluwer International Series in Engineering and Computer Science  
If a grammar attribute does not exist in the input, the grammar attribute value pair is added to the input.  ...  If the attribute does exist, the grammar and input values for this attribute are unified, and the results added to the input. This stage of unification can be  ...  Mapping of semantic roles to syntactic roles is achieved through the use of arguments to rules.  ... 
doi:10.1007/978-1-4757-5945-7_14 fatcat:x5d7qphuabh2hef4omhggbbite

SEQUIN: a grammar inference framework for analyzing malicious system behavior

Robert Luh, Gregor Schramm, Markus Wagner, Helge Janicke, Sebastian Schrittwieser
2018 Journal in Computer Virology and Hacking Techniques  
To facilitate the interpretation and analysis of APTs, we present SEQUIN, a grammar inference system based on the Sequitur compression algorithm that constructs a context-free grammar (CFG) from string-based  ...  Grammar inference paired with visual analytics (VA) techniques offers a powerful foundation for the automated extraction of behavioral patterns from sequential event traces.  ...  This selection prerequisite was complemented by the decision to use an attribute grammar for formal representation (see 3.3).  ... 
doi:10.1007/s11416-018-0318-x fatcat:mx2ivpzxwnce5d3gp2myf6qrqe

Sentence planning as description using tree adjoining grammar

Matthew Stone, Christine Doran
1997 Proceedings of the 35th annual meeting on Association for Computational Linguistics -  
We present an algorithm for simultaneously constructing both the syntax and semantics of a sentence using a Lexicalized Tree Adjoining Grammar (LTAG).  ...  At the same time, it exploits linguistically motivated, declarative specifications of the discourse functions of syntactic constructions to make contextually appropriate syntactic choices.  ...  In each domain, an extensive set of inferences, presumed known in common with the user, are required to ensure appropriate behavior. We use logic programming to capture these inferences.  ... 
doi:10.3115/976909.979643 dblp:conf/acl/StoneD97 fatcat:mtlfg3unxff63dscxza2myalx4

Logic-based genetic programming with definite clause translation grammars

Brian J. Ross
2001 New generation computing  
A DCTG is a logical version of an attribute grammar that supports the definition of context-free languages, and it allows semantic information associated with a language to be easily accomodated by the  ...  The DCTG-GP system improves on other grammar-based GP systems by permitting non-trivial semantic aspects of the language to be defined with the grammar.  ...  Their use of attribute grammars is closely related to DCTG-GP, since the semantic component of DCTG's is a logical implementation of an attribute grammar.  ... 
doi:10.1007/bf03037572 fatcat:ybx53tyi5vfy3auf3q4qpqkakm

Integration of conditional random fields and attribute grammars for range data interpretation of man-made objects

Jörg Schmittwilken, Michael Ying Yang, Wolfgang Förstner, Lutz Plümer
2009 Annals of GIS  
Acknowledgments The work is funded by Deutsche Forschungsgemeinschaft (German Research Foundation) FO 180/14-1 (PAK 274) within the Sino-German joint collaboration on 'Interpretation of 3D Urban Geoinformation  ...  Semantic rules are also used to constrain attribute values by thresholds or probability distribution functions.  ...  Patch labels are classified with respect to their local neighborhood. In the grammar module, an attribute grammar is used as a semantic model of the whole building with focus on the facade.  ... 
doi:10.1080/19475680903464696 fatcat:vetw4mank5gqtn72nbu7wgo3je

Application development with the FNC-2 attribute grammar system [chapter]

Martin Jourdan, Didier Parigot
1991 Lecture Notes in Computer Science  
A b s t r a c t FNC-2 is an advanced attribute grammar system aiming at production-quality, currently under development at INRIA.  ...  After a brief tour through its internMs and a short presentation of its input language OLGA, the talk will concentrate on how FNC-2 and its companions can be used to develop large language-processing applications  ...  OL~A allows to leave the definition of some attribute occurrences unspecified in an AG, and FNC-2 will try to infer the corresponding semantic rules from the context.  ... 
doi:10.1007/3-540-53669-8_71 fatcat:2fdcfl7rqfgbtl75olcyf7p4qm

Towards a semantics for XML markup

Allen Renear, David Dubin, C. M. Sperberg-McQueen
2002 Proceedings of the 2002 ACM symposium on Document engineering - DocEng '02  
project -the BECHAMEL Markup Semantics Project -that is attempting to develop such a semantics.  ...  On the positive side, XML constructs can be assigned arbitrary semantics and used in application areas not foreseen by the original designers.  ...  Our current focus is on the support of semantic inferences from databases of document instances as we believe that this will best stress the general decisions about choice of representation techniques.  ... 
doi:10.1145/585080.585081 fatcat:uggffwk5jnaf7jb7gk4eviec2e
« Previous Showing results 1 — 15 out of 11,021 results