A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We consider random logic programs with two-literal rules and study their properties. ... In particular, we obtain results on the probability that random "sparse" and "dense" programs with two-literal rules have answer sets. ... of programs, namely those with sufficiently many constraints, a transition from consistent to inconsistent programs can be observed (Zhao and Lin's model shows such transition, too). ...doi:10.1007/978-3-642-04238-6_20 fatcat:dfrfsnvrmzgfjfvuvnl3qp3nre
Miller], A logic programming language with lambda-abstraction, function variables, and simple unification (pp. 253-281); Lawrence C. Paul- son and Andrew W. ... Smith, Logic programming, functional pro- gramming, and inductive definitions (pp. 283-309); David Pearce and Gerd Wagner, Logic programming with strong negation (pp. 311-326); Peter Schroeder-Heister, ...
loop programs, 65, 18 Expressive power future perfect, in temporal logics, 67, 23 F Flowcharts propositional dynamic logic, 64, 119 Formulas correctness, and equivalence problem, for simple ... programs: applications to first-order dynamic logic, 65, 98 Dictionaries containing weighted elements: implicit data structures, 66, 61 Domains Scott, and synchronization trees and metric spaces ...doi:10.1016/s0019-9958(85)80038-3 fatcat:cnfpoerj4bgahkwbjf5nrkty5e
Not only can the deterministic test program test lots of faults using very small code size, but also the random test program can help detect some of the faults that the deterministic test program is difficult ... The random test methodology tries to make the pseudo-exhaustive testing possible using random instructions or patterns. ... Stage 2: Random test program development We develop a random test program generation methodology for fault coverage improvement of the test program. ...doi:10.1145/1363686.1364043 dblp:conf/sac/LuCL08 fatcat:ojwgrjui2ngkfpwfbyexo72vgq
This semantics not only is a simple and intuitive framework for performing argumentation and abduction in DLP, but also provides a unifying framework for many key semantics of disjunctive logic programs ... presented, which is quite simple and highly intuitive. ...
Lecture Notes in Computer Science
The Independent Choice Logic began in the early 90's as a way to combine logic programming and probability into a coherent framework. ... The idea of the Independent Choice Logic is straightforward: there is a set of independent choices with a probability distribution over each choice, and a logic program that gives the consequences of the ... However, this is not a Bayesian logic program (even if allHappy was a Boolean random variable). Bayesian logic program do not mean the same things by atoms in logic programs. ...doi:10.1007/978-3-540-78652-8_8 fatcat:pa67dsgq2rhgbgmrcdghjir6sa
We offer a model based on connection between three EL-description logic systems: classical, annotated(fuzzy) and a new variant of Bayesian description logic. ... In this position paper we share ideas on modeling querying web resources by (imperfect) combination of particular user preferences based on description logic. ... Our experiments in the logic programming framework give a well supported expectation that this could be a technically sound candidate for a simple, sufficiently expressive model for description of user ...dblp:conf/semweb/Vojtas06 fatcat:xrkrimhcjzbgphwcaufvzz6c3m
Our experimental results show that the pair-wise test cases had a higher level of MC/DC coverage compared to the random test cases, achieving more than 70% MC/DC coverage. ... To confirm this, we conducted experimental testing of logical expressions of different sizes, complexities, and numbers of input variables. ... Creation of "artificial" software programs that contain various sets of logical expressions. These programs had no real functionality but allowed us to evaluate coverage of logical expressions. ...doi:10.1109/icstw.2015.7107439 dblp:conf/icst/VilkomirA15 fatcat:svquslgihjdernrvox4algiy34
Lecture Notes in Computer Science
In practice, the syntax of Lisp is so simple and uniform that the translation process can be achieved easily, programs evolved by GP are usually expressed in Lisp. ... This paper presents a flexible framework that programs in various programming languages can be acquired. This framework is based on a formalism of logic grammars. ... The logic goal random(-10, 10, ?a) generates a random floating point number between -10 and 10 and instantiates ?a to the random number generated Ten random fitness cases are used for training. ...doi:10.1007/3-540-60437-5_35 fatcat:3zt24jocnjc25jujphik725otq
That is, the probabilities for different computational histories correspond to a computer that has been programmed with a random program. ... operations such as AND, OR and NOT some simple quantum logic operation such as the rotation of a quantum bit. 9 Such more general quantum computers will be considered below.) ...doi:10.1002/(sici)1099-0526(199709/10)3:1<32::aid-cplx10>3.0.co;2-x fatcat:sqsrc2oi25b4bbrwzlo7eplpfu
AbstractThis paper proposes a model, the linear model, for randomly generating logic programs with low density of rules and investigates statistical properties of such random logic programs. ... It is mathematically shown that the average number of answer sets for a random program converges to a constant when the number of atoms approaches infinity. ... , called simple random programs. ...doi:10.1017/s1471068414000611 fatcat:olqufref4rbdrhmhicoxeloc5e
A Computable Universe
That is, the probabilities for different computational histories correspond to a computer that has been programmed with a random program. ... operations such as AND, OR and NOT some simple quantum logic operation such as the rotation of a quantum bit. 9 Such more general quantum computers will be considered below.) ...doi:10.1142/9789814374309_0029 fatcat:yhol24kfazaurn4iufi3jtalkm
That is, the probabilities for different computational histories correspond to a computer that has been programmed with a random program. ... operations such as AND, OR and NOT some simple quantum logic operation such as the rotation of a quantum bit. 9 Such more general quantum computers will be considered below.) ...arXiv:quant-ph/9912088v1 fatcat:l27z24rorbdy5l6puhvvtaq2wa
Random test generation, logic emulation, and formal verification are applied to logic verification for shortening design time. ... The random test generator varies many factors of chip situation and the instructions themselves are randomly generated. But, by simple random test programs, it is hard to find logic bugs. ... Random Test Generation In logic simulation, quality of logic verification deeply depends on quality of the test programs. ...doi:10.1145/277044.277108 dblp:conf/dac/HattoriNSNUTS98 fatcat:g4z4wiwbufed3nqc6r6uc5fecq
In this paper we focus on the Logical Bayesian Network (LBN) formalism. ... Probabilistic logical models have proven to be very successful at modelling uncertain, complex relational data. ... Notice that the logic program defines which random variables appear in the model, or in other words, it determines different interpretations (assignments to random variables). ...dblp:conf/ilp/RavkicRD12 fatcat:uvupdp3pdfejvpncwuy5maxolq
« Previous Showing results 1 — 15 out of 271,676 results