17,596 Hits in 3.7 sec

Parameterizing a Groundness Analysis of Logic Programs [chapter]

Lunjin Lu
2001 Lecture Notes in Computer Science  
We present a parametric groundness analysis whose input and output are parameterized by a set of groundness parameters.  ...  The result of the analysis can be instantiated for different uses of the program.  ...  This motivated much research into semantic based analysis of logic programs [19] . Groundness analysis is one of the most important analyses for logic programs.  ... 
doi:10.1007/3-540-47764-0_9 fatcat:z3eanlywhrbtpjekh4uliqqjly

Page 7398 of Mathematical Reviews Vol. , Issue 2001J [page]

2001 Mathematical Reviews  
Both operations are applied in the static analysis of logic programs, in particular in the ground- ness analysis.  ...  This operation is applied to im- prove groundness analysis. A second operation is introduced in order to combine domains.  ... 

Parameterized Logic Programs where Computing Meets Learning [chapter]

Taisuke Sato
2001 Lecture Notes in Computer Science  
Although there are a variety of types of learning, we focus on parameter learning of logic programs, one for statistical learning by the EM algorithm and the other for reinforcement learning by learning  ...  In this paper, we describe recent attempts to incorporate learning into logic programs as a step toward adaptive software that can learn from an environment.  ...  [25] preserves the denotation of parameterized logic programs.  ... 
doi:10.1007/3-540-44716-4_3 fatcat:niahygqiq5gobnn5ml56dlwwve

Page 2866 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
This provides a precise logical account of the abstract domain Pos and of other domains for groundness analysis of logic programs. The paper is very well written and self-contained.  ...  The paper shows that a well-known abstract domain for ground- ness analysis (called Pos) of logic programs is optimal, namely it is the most abstract domain which includes groundness, and it is complete  ... 

Parameter Learning of Logic Programs for Symbolic-Statistical Modeling

T. Sato, Y. Kameya
2001 The Journal of Artificial Intelligence Research  
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. definite clause programs containing probabilistic facts with a parameterized distribution  ...  We also propose a new EM algorithm, the graphical EM algorithm, that runs for a class of parameterized logic programs representing sequential decision processes where each decision is exclusive and independent  ...  We call logic programs of this type a parameterized l o gic program and use for statistical modeling in which ground atoms 3 provable from the program represent our observations such as \one's blood type  ... 
doi:10.1613/jair.912 fatcat:abqliz2yxrbi3d5e6zeoh3tqd4

Schematic Polymorphism in the Abella Proof Assistant [article]

Gopalan Nadathur, Yuting Wang
2018 arXiv   pre-print
We develop schematic proof rules that ensure this property, a task that is complicated by the fact that type information influences the notion of unification that plays a key role in the logic.  ...  In this approach object constructors, formulas and other relevant logical notions are allowed to be parameterized by types, with the interpretation that they stand for the (infinite) collection of corresponding  ...  Opinions, findings and conclusions or recommendations that are manifest in this material are those of the participants and do not necessarily reflect the views of the NSF.  ... 
arXiv:1806.07523v1 fatcat:ozrmkgjvbjfrveethoiveh3eie

Page 8650 of Mathematical Reviews Vol. , Issue 2003k [page]

2003 Mathematical Reviews  
The authors investigate the complexity of some parameterized problems related to semantics of logic programs.  ...  k|, at most |At(P) — k|, and at least |At(P)—k| (At(P) is the set of all atoms of a program P) are considered for three classes of ground programs: the class of definite Horn programs, the class of purely  ... 

Verification of Parameterized Systems Using Logic Program Transformations [chapter]

Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan, Scott A. Smolka
2000 Lecture Notes in Computer Science  
We show how the problem of verifying parameterized systems can be reduced to the problem of determining the equivalence of goals in a logic program.  ...  a variety of network topologies, including uni-and bi-directional chains, rings, and trees of processes.  ...  of goals in a logic program.  ... 
doi:10.1007/3-540-46419-0_13 fatcat:wfn7l56ezjb7bkdmre3lriaiiy

Advances in Analyzing Coroutines by Abstract Conjunctive Partial Deduction

Vincent Nys
2015 International Conference on Logic Programming  
The current work describes a technique for the analysis of coroutining in Logic Programs.  ...  This provides greater insight into the execution of Logic Programs and yields a transformation from programs with nonstandard execution rules to programs with the standard execution rule of Prolog.  ...  It also prevents the use of program analysis and program optimization techniques developed for logic programs under a left-to-right execution rule.  ... 
dblp:conf/iclp/Nys15 fatcat:ll2neblmendu5cwmy6q6k2ejjm

Module theorem for the general theory of stable models

2012 Theory and Practice of Logic Programming  
The theorem is useful in the analysis of answer set programs, and is a basis of incremental grounding and reactive answer set programming.  ...  The generalization applies to non-ground logic programs allowing useful constructs in answer set programming, such as choice rules, the count aggregate, and nested expressions.  ...  incrementally parameterized disjunctive logic programs.  ... 
doi:10.1017/s1471068412000269 fatcat:373ef47hvvgjtfanjh6xd2apmi

Towards Parameterized Regular Type Inference Using Set Constraints [article]

F. Bueno, J. Navas, M. Hermenegildo
2010 arXiv   pre-print
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint systems).  ...  The resulting algorithm, together with a procedure to establish a set constraint system from a logic program, yields a program analysis that infers tighter safe approximations of the success types of the  ...  Zobel [24] also proposes a type inference method for a program, where the type of a logic program is defined as a recursive (regular) superset of its logical consequences.  ... 
arXiv:1002.1836v1 fatcat:dmjhqzliovfyzmxurvalrqy77q

Formal Analysis of Log Files

Howard Barringer, Alex Groce, Klaus Havelund, Margaret Smith
2010 Journal of Aerospace Computing Information and Communication  
of spacecraft telemetry by ground operations teams at NASA's Jet Propulsion Laboratory.  ...  Data parameterization is handled through parameterized automata: a state machine state can carry a vector of data values.  ...  Acknowledgments The research described in this paper was carried out at the Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration  ... 
doi:10.2514/1.49356 fatcat:y5gj6s5xnncvdbaepgjndg6aum

Page 7548 of Mathematical Reviews Vol. , Issue 2002J [page]

2002 Mathematical Reviews  
Summary: “We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, 1.e. definite clause programs containing probabilistic facts with a pa- rameterized  ...  “We also propose a new EM algorithm, the graphical EM al- gorithm, that runs for a class of parameterized logic programs representing sequential decision processes where each decision is exclusive and  ... 

LPG: A generic, logic and functional programming language [chapter]

D. Bert, P. Drabik, R. Echahed, O. Declerfayt, B. Demeuse, P -Y. Schobbens, F. Wautier
1988 Lecture Notes in Computer Science  
LPG is a programming language designed to implement and experiment new concepts in the field of specification languages. In LPG, programs are theories in Horn clause logic with equality [3] [4] .  ...  Taking advantage of the instantiation mechanism of generic operators, the interpreter is a good tool for testing specifications, prototyping, and functional programming. - A logical evaluator (called "  ...  Generic and logic programming: examples of evaluations of goals. Demonstration of the auxiliary tools (syntax-directed editor, etc.)  ... 
doi:10.1007/3-540-19027-9_26 fatcat:4d44vc7d5ffsbkb3u6up4g3fbi

Software licenses, coverage, and subsumption

Thomas A. Alspaugh, Walt Scacchi, Rihoko Kawai
2012 2012 Fifth IEEE International Workshop on Requirements Engineering and Law (RELAW)  
We present results from an analysis directed toward a formal representation capable of covering an entire license.  ...  Automated assistance requires a formal representation of the significant features of the software licenses involved.  ...  ACKNOWLEDGEMENTS This research is supported by grant #N00244-12-1-0004 from the Acquisition Research Program at the Naval Postgraduate School, and by grant #0808783 from the U.S.  ... 
doi:10.1109/relaw.2012.6347800 dblp:conf/re/AlspaughSK12 fatcat:4zc2hwngkfb4bmbnafkfixezvy
« Previous Showing results 1 — 15 out of 17,596 results