Filters








731,947 Hits in 4.2 sec

Outlier detection by logic programming

Fabrizio Angiulli, Gianluigi Greco, Luigi Palopoli
2007 ACM Transactions on Computational Logic  
We do that within the context of logic programming and, mainly through examples, we discuss its potential practical impact in applications.  ...  In this paper, we formally state the concept of outliers by generalizing that originally proposed in [3] in several respects, for instance, by having outliers not being restricted to single individuals  ...  Acknowledgments Thanks to Rachel Ben-Eliyahu-Zohary for fruitful discussion on the subjects of this paper and for having originally set up the outlier detection scenario.  ... 
doi:10.1145/1297658.1297665 fatcat:r6ntkk5asrbjnhaishcufn3v3q

Automated termination proofs for logic programs by term rewriting

Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann
2009 ACM Transactions on Computational Logic  
To simulate the behavior of logic programs by TRSs, we slightly modify the notion of rewriting by permitting infinite terms.  ...  There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program.  ...  ACKNOWLEDGMENTS We thank Mike Codish, Danny De Schreye, and Fred Mesnard for helpful comments and discussions on the results presented here and Roberto Bagnara, Samir Genaim, and Manh Thang Nguyen for  ... 
doi:10.1145/1614431.1614433 fatcat:wfd7oa7tcjgspf2j7vp7nd2ws4

Improving Lazy Non-Deterministic Computations by Demand Analysis

Michael Hanus, Marc Herbstritt
2012 International Conference on Logic Programming  
Functional logic languages combine lazy (demand-driven) evaluation strategies from functional programming with non-deterministic computations from logic programming.  ...  On the other hand, this improvement could cause efficiency problems if unevaluated subexpressions are duplicated and later evaluated in different parts of a program.  ...  It has been shown [9, 25] that computing with logic variables by narrowing [48, 51] and computing with generators by rewriting are equivalent, i.e., compute the same values.  ... 
doi:10.4230/lipics.iclp.2012.130 dblp:conf/iclp/Hanus12 fatcat:brk5o7y5rvajrgcoiqkpnxgop4

Towards programs logic based representation driven by grammar and conforming to a metamodel

Ciprian-Bogdan Chirila, Calin Jebelean
2010 2010 International Joint Conference on Computational Cybernetics and Technical Informatics  
Logic representation of programs gives an expressive way to perform analysis and transformation.  ...  Logic representation mapping rules express how programs can be automatically translated into metamodel conforming logic representation.  ...  In this paper we present how programs can be translated into a metamodel conforming logic representation driven by grammar (see figure 1 ).  ... 
doi:10.1109/icccyb.2010.5491319 fatcat:3rzyojxeobdbniifvgzoktg4v4

Feature Description Systems for Clusters by Using Logical Rule Generations Based on the Genetic Programming and Its Applications to Data Mining [chapter]

Jianjun Lu, Yunling Liu, Shozo Tokinaga
2007 Lecture Notes in Computer Science  
This paper deals with the realization of retrieval and feature description systems for clusters by using logical rule generations based on the Genetic Programming (GP).  ...  The GP method is applied to various real world data by showing effective performance compared to conventional methods.  ...  Introduction This paper deals with the feature description systems for clusters by using rule generations based on the Genetic Programming (GP) and its applications to data mining [4] [5] .  ... 
doi:10.1007/978-3-540-72590-9_23 fatcat:rosr45ryhjfuhl3jx7gqumbvq4

Modeling and prototyping dynamically reconfigurable systems for efficient computation of dynamic programming methods by rewriting-logic

Mauricio Ayala-Rinc�n, Ricardo P. Jacobi, Luis G. A. Carvalho, Carlos H. Llanos, Reiner W. Hartenstein
2004 Proceedings of the 17th symposium on Integrated circuits and system design - SBCCI '04  
We show how to use rewriting-logic to model and evaluate reconfigurable systolic architectures which are applied to the efficient treatment of several dynamic programming methods for resolving well-known  ...  This limitation can be circumvented by using reconfigurable systolic arrays, where the node interconnections and operations can be redefined even at run time.  ...  on dynamic programming methods, but that is also adequate for implementing even more general dynamic programming solutions.  ... 
doi:10.1145/1016568.1016634 dblp:conf/sbcci/Ayala-RinconJCLH04 fatcat:b63gnup3hbct7gxmagu7ef5lvy

ALPS: a logic for program synthesis (motivated by fuzzy logic)

D.E. Cooke, V. Kreinovich, S.A. Starks
1998 IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36228)  
This made us think that logic can be useful in non-traditional program synthesis situations.  ...  This means that we are able to compute B from A. Let us denote by f (A) the result of applying these computations.  ... 
doi:10.1109/fuzzy.1998.687589 fatcat:bqpzxpgbmfdxvifjhmdtkkzofu

EPiC Series in Computing Programming by Composing Filters

Jeffrey Fischer, Rupak Majumdar
2017 Pages 1-13 LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning   unpublished
We provide a transition system semantics for such programs based on infinite-state Markov decision processes.  ...  Programs are compositions of filters. The filters are scheduled and run by an explicit, asynchronous, scheduler.  ...  Consider a pipeline that captures the readings of a light sensor and uses the sensed value in a decision logic to turn a light on or off.  ... 
fatcat:iocbvtfodnciplgzphwt34swgy

Extracting Non-Deterministic Concurrent Programs

Ulrich Berger
2016 licensed under Creative Commons License CC-BY 25th EACSL Annual Conference on Computer Science Logic (CSL   unpublished
We introduce an extension of intuitionistic fixed point logic by a modal operator facilitating the extraction of non-deterministic concurrent programs from proofs.  ...  Infinite Gray code stands out from other encodings of real numbers by the fact that it is at the same time unique (every real number in I has exactly one Gray code) and computable 1 Tsuiki considers reals  ...  We extend the programming language introduced in Sect. 2 by constructs for concurrent computation, where the latter is modeled by a family of computations indexed by a set I which is the least set containing  ... 
fatcat:qbnervvvbvbvnowi4whfl5eqbu

EPiC Series in Computing Proving uniformity and independence by self-composition and coupling

Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub
2017 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning   unpublished
Specifically, we show that the program logic pRHL-whose proofs are formal versions of proofs by coupling-can be used for formalizing uniformity and probabilistic independence.  ...  Proof by coupling is a classical proof technique for establishing probabilistic properties of two probabilistic processes, like stochastic dominance and rapid mixing of Markov chains.  ...  This work was partially supported by NSF grants TC-1065060 and TWC-1513694, by the European Union's H2020 Programme under grant agreement number ICT-644209, and a grant from the Simons Foundation (#360368  ... 
fatcat:qrjsnceqm5gs3f3uvgw7cekffe

Learning optimal dialogue management rules by using reinforcement learning and inductive logic programming

Renaud Lecœuche
2001 Second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies 2001 - NAACL '01   unpublished
We also investigate the capability of these rules in directing the search for the optimal strategy by looking for generalization whilst the search proceeds.  ...  In this paper we tackle this problem by learning rules that generalize the state-based strategy. These rules are more readable than the underlying strategy and therefore easier to explain and re-use.  ...  We suggested using inductive logic programming to generalize the results given by reinforcement learning methods.  ... 
doi:10.3115/1073336.1073364 fatcat:wz4uarskurfybmhu5qlgkf6iuy

9–Volume Series on Robot Technology (Senior Editor and Consultant, P. Coiffet, University of Montpelier, France; English Language Series Consultant, I. Aleksander, Imperial College, London, U.K.9–Volume Series on Robot Technology Vol. 1, Modelling and Control by P. Coiffet, 1983 (£25) Kogan Page Ltd, 120 Pentonville Road, London N1, U.K.9–volume series on robot technology Vol. 2, Interaction with the Environment by P. Coiffet, 1983 (£30) Kogan Page Ltd, 120 Pentonville Road, London N1, U.K.9–volume series o ...

Tony Owen
1987 Robotica (Cambridge. Print)  
A long article on intestinal surgery is contributed by J. B. Murphy, .whose opinion, founded on a wide experience, always commands attention.  ...  There are special sections on the surgery of the Ear, the Eye, Military and Naval Surgery, the Surgery of the Tropics, and a chapter by Rodman on the Influence of Race, Sex and Age in Surgical Affections  ... 
doi:10.1017/s0263574700009838 fatcat:dac37sgl3rev7lip4e36zxsnim

KWIC (key word in context)

1984 The Journal of Logic Programming  
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  ...  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  ...  Kemal Language of Fifth Generation Computing Algorithms and Proving Properties by Computing Terms [454] Computing Terms [454]Computing Algorithms and Proving Properties by Computing with  ... 
doi:10.1016/0743-1066(84)90025-6 fatcat:ypq2jrr3mvd3hflnp6ftrcd5vm

Page 7760 of Mathematical Reviews Vol. , Issue 96m [page]

1996 Mathematical Reviews  
The standard results on rep- resentability of all computable predicates by Horn clause logic programs are not related to the real universe on which logic pro- grams operate.  ...  (S-UPPS-CS; Uppsala) On computability by logic programs. (English summary) Ann. Math. Artificial Intelligence 15 (1995), no. 3-4, 437-456.  ... 

Page 2045 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
B. (1- UCSD; La Jolla, CA) On the expressibility of stable logic programming. (English summary) Logic programming and nonmonotonic reasoning (Vienna, 2001), 107-120, Lecture Notes in Comput.  ...  One sim- ple extension of logic programming consists of introducing a set of basic program composition operations, which form an alge- bra of logic programs with interesting properties for reasoning about  ... 
« Previous Showing results 1 — 15 out of 731,947 results