Filters








2,466 Hits in 9.0 sec

Meta-Evaluation as a Tool for Program Understanding

Robert Balzer, Neil M. Goldman, David S. Wile
1977 International Joint Conference on Artificial Intelligence  
parts of the specification interacting with one another.  ...  This paper describes the technology used in a running system which embodies theories of program well-formedness and informality resolution within the context established by symbolically executing the program  ...  Ift on the other hand, the pattern does not match existing data, then new symbolic data is created (and assumed to be part of the input data to the program) so that the pattern match can succeed.  ... 
dblp:conf/ijcai/BalzerGW77a fatcat:ylsbmdgzanbtngp3qcsrtjl5zi

Dynamic detection of determinism in functional logic languages

Rita Loogen, Stephan Winkler
1995 Theoretical Computer Science  
In this paper we show how to achieve this and what can be gained by this optimization and winkler@zeus.informatikxwth-aachen.de. 0304 -3975/95/%X39.50 0 1995-Elsevier Science B.V.  ...  Programs in functional logic languages usually have to satisfy a nonambiguity condition, that semantically ensures completeness of conditional narrowing and pragmatically ensures that the defined (nonboolean  ...  Note that reduction machines, which do not presume a pattern matching compiler, also have to work with choice points noting the address of the next alternative rule during pattern matching.  ... 
doi:10.1016/0304-3975(94)00225-8 fatcat:ynzuhry2vjbhvbmcn732n3mwee

Decoding Substitution Ciphers by Means of Word Matching with Application to OCR

George Nagy, Sharad Seth, Kent Einspahr
1987 IEEE Transactions on Pattern Analysis and Machine Intelligence  
ACKNOWLEDGMENT The authors wish to thank D. Kreher for an earlier implementation of the algorithm and C. Grimes for experimentation with dictionaries. The help by T. Meyer and S.  ...  Lloyd with the preparation of this manuscript is also gratefully acknowledged.  ...  CONCLUSIONS AND DISCUSSION This study was performed to explore to what extend Markovian modeling of sleep patterns, coupled with pattern recognition techniques, can be used to describe normal and abnormal  ... 
doi:10.1109/tpami.1987.4767969 fatcat:zq4s7f42vfeyjl6jng5hwo5gve

Equality for Prolog

William A. Kornfeld
1983 International Joint Conference on Artificial Intelligence  
If it is possible to prove that the two terms are equal the unification succeeds with the variable bindings introduced by the equality proof.  ...  Sophisticated data abstraction with all the advantages of object-oriented programming is available.  ...  Suppose we attempt to match (foo 1) with (bar 2).  ... 
dblp:conf/ijcai/Kornfeld83 fatcat:z323arikjbfwzdwcnmjrnvz4vy

Approximations and Randomization to Boost CSP Techniques

Carla P. Gomes, David B. Shmoys
2004 Annals of Operations Research  
We propose a complete randomized backtrack search method for combinatorial problems that tightly couples CSP propagation techniques with randomized LP-based approximations.  ...  While considerable progress has been made in the integration of these techniques for solving problems that exhibit a mixture of linear and combinatorial constraints, it has been surprisingly difficult to  ...  This research was partially supported by AFOSR grants F49620-01-1-0076 (Intelligent Information Systems Institute) and F49620-01-1-0361 (MURI) and NSF grant (CCR-9912422). 5.  ... 
doi:10.1023/b:anor.0000032572.32788.da fatcat:vsv7gbx2h5fnpagac72if2h2iu

Cryptic Mining in Light of Artificial Intelligence

Shaligram Prajapat, Aditi Thakur, Kajol Maheshwari, Ramjeevan Singh
2015 International Journal of Advanced Computer Science and Applications  
Human brains do this intelligently. The intelligent cryptic analysis process needs learning algorithms, co-operative effort of cryptanalyst and mechanism of knowledge based inference engine.  ...  The process demonstrated in this paper attempts to analyze captured cipher from scratch.  ...  -def backtrack(word) If no pattern match is found for a word then that word is passed as the argument to backtrack, it will replace the plain letter with their corresponding original cipher letter as the  ... 
doi:10.14569/ijacsa.2015.060808 fatcat:r664zxnidvbzhgaqx6kwogwrze

A Temporal Pattern Search Algorithm for Personal History Event Visualization

T. D. Wang, A. Deshpande, B. Shneiderman
2012 IEEE Transactions on Knowledge and Data Engineering  
We also show TPS is very competitive with Shift-And, a bit-parallel approach, with real data.  ...  We present Temporal Pattern Search (TPS), a novel algorithm for searching for temporal patterns of events in historical personal histories.  ...  ACKNOWLEDGMENT We appreciate the support from NIH-National Cancer Institute grant RC1CA147489-02: Interactive Exploration of Temporal Patterns in Electronic Health Records.  ... 
doi:10.1109/tkde.2010.257 fatcat:g2cj2thctfbhxckwt6mhx25guq

EXTRACTION AND MATCHING OF SYMBOLIC CONTOUR GRAPHS

TINO LOURENS, ROLF P. WÜRTZ
2003 International journal of pattern recognition and artificial intelligence  
We describe an object recognition system based on symbolic contour graphs. The image to be analyzed is transformed into a graph a with object corners as vertices and connecting contours as edges.  ...  We provide experimental evidence and theoretical arguments that the matching complexity is below O(#V 3 ), and show that the system is competitive with other graph-based matching systems.  ...  After that an extraction algorithm should be applied to obtain a symbolic representation.  ... 
doi:10.1142/s0218001403002848 fatcat:uepweunw5rhwfhm7av677m6vny

Intelligent Systems for Active Program Diagnosis

Haider Ali Ramadhan, Khalil Shihab
2000 Sultan Qaboos University Journal for Science  
Finally the paper presents a detailed discussion on issues related to active program diagnosis along with various design considerations to improve the engineering of this approach to intelligent diagnosis  ...  The most distinct split is between those systems that are unable to analyze partial code segments as they are provided by the user and must wait until the entire solution code is completed before attempting  ...  The system much like Laura, Talus, Aurac and Bridge, applies various heuristics and pattern matching techniques to match steps taken by the user with parts of the reference solution.  ... 
doi:10.24200/squjs.vol5iss0pp157-183 fatcat:7vhydsa5s5hxtapdm62g6de6zq

An Automatically Compilable Recognition Network For Structured Patterns

Frederick Hayes-Roth, D. Moslow
1975 International Joint Conference on Artificial Intelligence  
The recognition network operates in a bottom-up fashion, in which all possibilities for pattern matches are evaluated simultaneously.  ...  Patterns to be recognized are defined by templates consisting of a set of predicate calculus relations. Productions are representable by associating actions with templates.  ...  A partial match consists of an assignment of input constants to the symbolic variables of a subset of template relations which makes them all true.  ... 
dblp:conf/ijcai/Hayes-RothM75 fatcat:krghd4gx6zcpzg77vcgyidi6fa

Using the Corpus of Spoken Afrikaans to generate an Afrikaans chatbot

Bayan Abu Shawar, Eric Atwell
2003 Southern African Linguistics and Applied Language Studies  
This paper presents two chatbot systems, ALICE and Elizabeth, illustrating the dialogue knowledge representation and pattern matching techniques of each.  ...  We discuss the problems which arise when using the Corpus of Spoken Afrikaans (Korpus Gesproke Afrikaans) to retrain the ALICE chatbot system with human dialogue examples.  ...  Also Gerhard van Huyssteen provided us with some greeting dialogue to improve Afrikaana.  ... 
doi:10.2989/16073610309486349 fatcat:67d5a3gryfexfdg4mcx2a5c3bq

TREE: the Heuristic Driven Join Strategy of a RETE-Like Matcher

Jacques Bouaud
1993 International Joint Conference on Artificial Intelligence  
Unlike RE IE, the indexing scheme TREE requires is not based on the membership of condition elements but on the sharing of references to symbols.  ...  Its join strategy uses constraint propagation to define the solution space of a join, then a constraint relaxation to determine the index to be used in the join computation.  ...  Acknowledgements We would like to thank B. Bachimont, I. Bichindaritz, M. Cavazza, and L. Dore for gracefully providing the rule-based programs we used.  ... 
dblp:conf/ijcai/Bouaud93 fatcat:zwitqvuht5exlg4laig7qzdgzu

Visual analogy: Viewing analogical retrieval and mapping as constraint satisfaction problems

Patrick W. Yaner, Ashok K. Goel
2006 Applied intelligence (Boston)  
We use a method of constraint satisfaction with backtracking for the retrieval and mapping tasks, with subgraph isomorphism over a particular domain language as the similarity measure.  ...  Visual analogical reasoning pertains to problems containing only visual knowledge.  ...  This paper has improved due to comments by anonymous reviewers.  ... 
doi:10.1007/s10489-006-8868-x fatcat:ihnhaf5jffgcfg5cxybrdoq5lm

Programming languages for artificial intelligence

J. Glasgow, R. Browse
1985 Computers and Mathematics with Applications  
Through comparisons with LISP and PROLOG, it is shown that the NIAL system meets the basic requirements for artificial intelligence programming.  ...  This paper briefly describes the two most popular programming languages for artificial intelligence applications: LISP and PROLOG.  ...  a match for an initiating pattern (or goal).  ... 
doi:10.1016/0898-1221(85)90049-5 fatcat:2qcdtcrokfdopnauu2gpbpwjty

Graph Edit Distance for the analysis of children's on-line handwritten arithmetical operations

Arnaud Lods, Eric Anquetil, Sebastien Mace
2020 2020 17th International Conference on Frontiers in Handwriting Recognition (ICFHR)  
The GED computation being a NPcomplete problem, we propose to use sub-graph isomorphism: we partially match the instruction on each hypothesis in polynomial time to cut part of the tree search.  ...  The time required for the GED computation is evaluated.  ...  ACKNOWLEDGMENT With the support from the LabCom ScriptAndLabs founded by the ANR ANR-16-LVC2-0008-01. With the support from the ANRT.  ... 
doi:10.1109/icfhr2020.2020.00068 fatcat:bk2bdviv7vcdlnxmn5dmpnq2ki
« Previous Showing results 1 — 15 out of 2,466 results