Filters








3,781 Hits in 2.8 sec

KWIC (key word in context)

1984 The Journal of Logic Programming  
Model to Efficient Compilation of Patterns [166]From Abstract PROLOG Instruction Set [672]An Abstract PROLOG Machine-a Specification [383] Abstract PROLOG Machine and its Application to Partial Evaluation  ...  [336] on of an Abstract PROLOG Machine [334]An Abstraction in Logic Programming [198]Modularization and Abstraction in Logic Programming [199]Modularization and Abstraction in PROLOG/KR [439]Data Acceptability  ...  Illustrated by a Program for the Game of Mathematical Logic T-PROLOG [215]A Modelling Tool Based on Mathematical Logic [374]_s Using Programming Lan- guage PROLOG-PROLOG Based Upon Mathematical  ... 
doi:10.1016/0743-1066(84)90025-6 fatcat:ypq2jrr3mvd3hflnp6ftrcd5vm

Fuzzy Logic Rules Modeling Similarity-based Strict Equality

Ginés Moreno, Jaime Penabad, Carlos Vázquez
2014 Proceedings of the 2014 Federated Conference on Computer Science and Information Systems  
flexible one of similarity-based equality used in modern fuzzy-logic programming languages (such as LIKELOG and BOUSI∼PROLOG), similarity relations can be successfully treated while mathematical functions  ...  Now, we are concerned with the socalled Multi-Adjoint Logic Programming approach, MALP in brief, which can be seen as an enrichment of PROLOG based on weighted rules with a wide range of fuzzy connectives  ...  , thus producing the illusion on the final user of being working with a purely fuzzy logic programming tool.  ... 
doi:10.15439/2014f387 dblp:conf/fedcsis/MorenoPV14 fatcat:jp6x4stuqnhfbpemd43y5ytp2e

Abstract State Machines 1988-1998: Commented ASM Bibliography [article]

Egon Boerger, James K. Huggins
1998 arXiv   pre-print
tree based model of [17] by a pure tree model for Prolog.  ...  editors for languages defined with Montages. [ A formal semantic model of Basic SDL-92 -according to the ITU-T Recommendation Z.100 -is defined in terms of an abstract SDL machine based on the concept  ... 
arXiv:cs/9811014v1 fatcat:w3vj5i7mzbccbcibroi7dkmhtq

Preface

1990 Computers and Mathematics with Applications  
Kersten et al.. describes a rule-based decision support tool. NEGOPLAN. which allows one to model the decision process of an autonomous agent in a randomly changing environment.  ...  NEGOPLAN has been used to model an exploratory mission of a robot collecting material on the surface of a hypothetical planet. The fourth paper, by T.  ...  Lirov, on the applications of logic programming in decisions and control concludes this special issue. It contains 330 items subdivided into 18 application areas.  ... 
doi:10.1016/0898-1221(90)90107-u fatcat:plhtmqr3mzbm5plxd4bf4sxiwq

Prolog at IBM: An advanced and evolving application development technology

M. Benichou, H. Beringer, J.-M. Gauthier, C. Beierle
1992 IBM Systems Journal  
Second, there is a perception that Prolog is a dif- ficult language to learn and master because it is based on mathematical logic, which may be in- timidating.  ...  Prolog at IBM: An advanced and evolving application development technology Prolog is a powerful programming language, based on logic, that originated and matured in Europe.  ... 
doi:10.1147/sj.314.0755 fatcat:jidyrgtlzvfihjz3pj6mum7bse

A subject bibliography of logic programming applications in control and decision support systems

V. Lirov, Y. Lirov
1990 Computers and Mathematics with Applications  
Abstraet--A bibliograph2r on applications of logic programming in decisions and control is presented.  ...  Prolog predicates on the aforementioned set.  ...  ., A LOGIC PROGRAMMING FRAMEWORK FOR PLANNING AND SIMULATION Li, Han-Lin, SOLVING DISCRETE MULTICRITERIA DECISION PROBLEMS BASED ON LOGIC-T.  ... 
doi:10.1016/0898-1221(90)90118-4 fatcat:stbjrxrijbb3ricuz6qkhccotm

Programming languages for artificial intelligence

J. Glasgow, R. Browse
1985 Computers and Mathematics with Applications  
The nested interactive array language, NIAL, is introduced as a language that combines logic and functional programming capabilities.  ...  The capabilities and limitations of each language arc reviewed in the context of establishing the main requirements placed on artificial intelligence languages.  ...  It is based on the formal theory of the nested rectangular array as a mathematical data object. This theory was introduced by T.  ... 
doi:10.1016/0898-1221(85)90049-5 fatcat:2qcdtcrokfdopnauu2gpbpwjty

Programming Smart Environments Using π-calculus

V. Geetha Lekshmy, Jasmine Bhaskar
2015 Procedia Computer Science  
language which provides strong mathematical base that can be used for modelling and verifying system requirements.  ...  Though, a lot of innovations have taken place in this field, there are no good mechanisms for describing and modelling smart environments in a formal manner. π -calculus, proposed by Milner is a formal  ...  Formal methods seems to be a promising way of modelling complex system as they can model the requirements in the form of properties by using logic based on mathematics and formally verifying the modeled  ... 
doi:10.1016/j.procs.2015.02.158 fatcat:zdcweum3drgyll3biptu2etl7m

A Metamodel-driven Architecture for Generating, Populating and Manipulating "Possible Worlds" to Answer Questions
english

Imre Kilián, Gábor Alberti
2013 Proceedings of the 8th International Joint Conference on Software Technologies  
of our databases; the other one is a Prolog-based logical framework, which is responsible for populating the database and for logically "closing" its appropriate substructures.  ...  The Prolog inference system operates on a partially ordered structure with which we furnish WT, in order to answer users' yes/no questions and to provide entities of wordlets as answers to wh-questions  ...  ACKNOWLEDGEMENTS We are grateful to a Hungarian national fund for their contribution to our costs at ICSOFT 2013 We also express our thanks to our colleagues: Márton Károly and Judit Kleiber for their  ... 
doi:10.5220/0004596000740078 dblp:conf/icsoft/KilianA13 fatcat:ocqnexxdn5atzfgssn5xctmhiu

Page 2814 of Mathematical Reviews Vol. , Issue 91E [page]

1991 Mathematical Reviews  
Laurent Kott (Le Chesmay) 91e:68107 68Q55 03B70 68NI17 68TI15 68T25 Palamidessi, Catuscia (I-PISA-CS) On the declarative semantics of Horn clause logic-based languages.  ...  Efficient algorithms based on it are con- structed for synthesizing programs for computational problems in the class of the computational models in question.” 68 COMPUTER SCIENCE 91e:68106 68Q55 03B35  ... 

An object-oriented modelling enviornment

T. W. Page, S. Berson, W. Cheng, R. R. Muntz
1989 SIGPLAN notices  
This system has been prototyped in an objectoriented extension to Prolog. The impact that these two paradigms, logic and objects, have had on the design is discussed.  ...  Many tools and techniques exist for the modeling and analysis of computer and communication systems. These tools are often complex and tailored to a narrow range of problems.  ...  Acknowledgements The authors wish to acknowledge the contributions of Gary Rozenblat, Leana Golubchik, and Jon Edwards to the implementation of the Tangram modeling system.  ... 
doi:10.1145/74878.74907 fatcat:gbmtj3hcujh7toavzblrsvf2ta

Teaching Computer Languages and Elementary Theory for Mixed Audiences at University Level

Henning Christiansen
2004 Computer Science Education  
Theoretical issues of computer science are traditionally taught in a way that presupposes a solid mathematical background and are usually considered more or less unaccessible for students without this.  ...  It has been developed for a course that integrates theoretical material on computer languages and abstract machines with practical programming techniques.  ...  Logic circuits modelled in Prolog is a standard example used in many Prolog text books and is obvious to apply in our context due to the meta-linguistic aspects (modelling the language of logic circuits  ... 
doi:10.1080/0899340042000302727 fatcat:zbhxh3dvtvafximdkfyjg3rrse

Declarative programming for verification

Michael Leuschel
2008 Proceedings of the 10th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '08  
model-based specifications such as Z and B.  ...  More precisely, we present insights gained and lessons learned while implementing animators and model checkers in Prolog for various specification languages, ranging from process algebras such as CSP to  ...  More Related Work There are variety of relatively generic CTL model checkers, such as [31, 36, 16] . Both [36] and [16] are based on constraint logic programming.  ... 
doi:10.1145/1389449.1389450 dblp:conf/ppdp/Leuschel08 fatcat:f55xkcbjaral7lytcr6odnmsee

Page 1051 of Mathematical Reviews Vol. , Issue 91B [page]

1991 Mathematical Reviews  
Cuadrado, A truth maintenance system based on 91b:68007 stable models (pp. 274-290); Jia-Huai You and Li Wu Li, Sup- ported circumscription and its relation to logic programming with negation (pp. 291-  ...  Shyam Mudambi, Performance of Aurora on a switch-based multiprocessor (pp. 697-712); Péter Szeredi, Performance anal- ysis of the Aurora or-parallel Prolog system (pp. 713-732); H.  ... 

Page 5443 of Mathematical Reviews Vol. , Issue 88j [page]

1988 Mathematical Reviews  
Despain, Semi-intelli- gent backtracking of Prolog based on static data dependency analy- sis (pp. 10-21); J. I. Glasgow, M. A. Jenkins and C. D.  ...  Gallier and Stan Raatz, Logic programming and graph rewriting (pp. 208-219); P. T. Cox and T.  ... 
« Previous Showing results 1 — 15 out of 3,781 results