58,076 Hits in 4.0 sec

A Backward Analysis for Constraint Logic Programs [article]

Andy King, Lunjin Lu
2002 arXiv   pre-print
In the context of (constraint) logic programming, part of this problem reduces to figuring out how to query a program.  ...  If the logic program does not come with any documentation, then the programmer is forced to either experiment with queries in an ad hoc fashion or trace the control-flow of the program (backward) to infer  ...  We would also like to thank the anonymous referees for their comments and Peter Schachte for his BDD analyser. We also thank Roberto Bagnara for the use of some of the China benchmarks.  ... 
arXiv:cs/0201011v1 fatcat:d54rft522jan7ppuksgb7bant4

Backward Type Inference Generalises Type Checking [chapter]

Lunjin Lu, Andy King
2002 Lecture Notes in Computer Science  
This paper presents a backward type analysis for logic programs.  ...  Thus, the backward type analysis generalises type checking in which the programmer manually specifies type signatures for all predicates that are checked for consistency by a type checker.  ...  Summary A novel backward type analysis for logic programs has been presented.  ... 
doi:10.1007/3-540-45789-5_9 fatcat:6doywbnqfvfcvk4l67dfyqpqge

Automatic optimization of dynamic scheduling in logic programs [chapter]

Germán Puebla, Manuel Hermenegildo
1996 Lecture Notes in Computer Science  
In fact, it has been shown that many such languages can be directly translated into (constraint) logic programs with dynamic scheduling with competitive efficiency.  ...  As a result, languages with dynamic scheduling are being seen more and more as very useful targets for prototyping or even implementing concurrent languages.  ...  In fact, it has been shown that many such languages can be directly translated into (constraint) logic programs with dynamic scheduling with competitive efficiency.  ... 
doi:10.1007/3-540-61756-6_107 fatcat:iorcwrrahvdbpmda3k27trkj7u

Improving Reachability Analysis of Infinite State Systems by Specialization [chapter]

Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2011 Lecture Notes in Computer Science  
We propose a method based on program specialization, which improves the effectiveness of the backward and forward reachability analyses.  ...  For backward reachability our method consists in: (i) specializing the reactive system with respect to the initial states, and then (ii) applying to the specialized system the reachability analysis that  ...  Acknowledgements This work has been partially supported by PRIN-MIUR and by a joint project between CNR (Italy) and CNRS (France).  ... 
doi:10.1007/978-3-642-24288-5_15 fatcat:c4f7eivaevailgoguwoayydovq

Infeasible Path Detection Based on Code Pattern and Backward Symbolic Execution

Yang Song, Xuzhou Zhang, Yun-Zhan Gong
2020 Mathematical Problems in Engineering  
We then develop a path feasibility detection method based on backward symbolic execution.  ...  But there is a lack of research on the distribution of contradict constraints currently.  ...  Symbolic execution is a static program analysis technique that explores program paths with symbolic values and collects execution information for further analysis. e applications of symbolic execution  ... 
doi:10.1155/2020/4258291 doaj:2c83a84dd4a9423e9d35a79c5339a3d4 fatcat:kkiscy54bnempegy4np6rukx3u

Controlling Polyvariance for Specialization-based Verification

Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2011 Italian Conference on Computational Logic  
Safety properties are specified by constraint logic programs encoding (backward or forward) reachability algorithms.  ...  These programs are transformed, before their use for checking safety, by specializing them with respect to the initial states (in the case of backward reachability) or with respect to the unsafe states  ...  Thanks to Laurent Fribourg and John Gallagher for many stimulating conversations.  ... 
dblp:conf/cilc/FioravantiPPS11 fatcat:ymfbs5na3va7lo6pe5yzeyx2zu

Agent Deliberation via Forward and Backward Chaining in Linear Logic [chapter]

Luke Trodd, James Harland, John Thangarajah
2013 Lecture Notes in Computer Science  
Using logic as a basis for the architecture will mean that we can develop methods for formal analysis of agent systems via logical inference, as well  ...  Often there are many ways to achieve a set of goals that the agent is working on, implying the need for a mechanism to choose between them.  ...  Backward-chaining methods have been the basis of logic programming languages based on linear logic, such as Lygon [5] .  ... 
doi:10.1007/978-3-642-37890-4_4 fatcat:fjttwejbh5evzky2wut5mslham

Range and bitmask analysis for hardware optimization in high-level synthesis

M. Gort, J. H. Anderson
2013 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC)  
For a set of benchmarks implemented in the Altera Cyclone II FPGA, results show bit-level optimizations in HLS based on static analysis reduce circuit area by 9%, on average, while additional optimizations  ...  Range analysis aims to predetermine min/max ranges for variables to reduce the bitwidth required to represent variables in hardware.  ...  Su and Wager's approach formulates a set of constraints for each variable.  ... 
doi:10.1109/aspdac.2013.6509694 dblp:conf/aspdac/GortA13 fatcat:d2c4xlfihbevnpypxfx672ijp4

XML reasoning made practical

Pierre Geneves, Nabil Layaida
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
We present a tool for the static analysis of XPath queries and XML Schemas.  ...  It can also be used in type-checkers and optimizing compilers that need to perform all kinds of compile-time analyses involving XPath queries and XML tree constraints.  ...  We present a tool for XML/XPath static analysis based on our earlier theoretical work [3] , [4] .  ... 
doi:10.1109/icde.2010.5447786 dblp:conf/icde/GenevesL10 fatcat:euz7evgi2zcbboho44ojbvwx44

Inferring Termination Conditions for Logic Programs using Backwards Analysis [article]

Samir Genaim, Michael Codish
2003 arXiv   pre-print
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate.  ...  Our contribution is a methodology in which components of traditional termination analysis are combined with backwards analysis to obtain an analyser for termination inference.  ...  Acknowledgement We thank Andy King, Fred Mesnard and Cohavit Taboch for the useful discussions, as well as the exchange of code and benchmarks.  ... 
arXiv:cs/0312023v1 fatcat:764we4ejb5a4jbjqma7kn3rpvm

Probabilistic (logic) programming concepts

Luc De Raedt, Angelika Kimmig
2015 Machine Learning  
While doing so, we focus on probabilistic extensions of logic programming languages such as Prolog, which have been considered for over 20 years.  ...  A multitude of different probabilistic programming languages exists today, all extending a traditional programming language with primitives to support modeling of complex, structured probability distributions  ...  Acknowledgements The authors are indebted to Bernd Gutmann and Ingo Thon for participating in many discussions, and contributing several ideas during the early stages of the research that finally led to  ... 
doi:10.1007/s10994-015-5494-z fatcat:6bgcvas4lfed5invj2jjb7wfmy

Reasoning with conditionals in artificial intelligence [chapter]

Robert Kowalski
2010 Cognition and ConditionalsProbability and Logic in Human Thinking  
The semantics and proof procedures of logic programming and ALP are based on classical logic, but are sufficiently different to be a potential source of difficulty for some readers.  ...  In the ALP agent framework, the thinking component of the cycle is a combination of forwards reasoning, as in production systems, and backwards reasoning, as in logic programming.  ...  Thanks too to Mike Oaksford for the invitation to contribute to this volume.  ... 
doi:10.1093/acprof:oso/9780199233298.003.0015 fatcat:wzs5uvx6rbhbxjlklyxpqfgjpu

NoMoRe: Non-monotonic Reasoning with Logic Programs [chapter]

Christian Anger, Kathrin Konczak, Thomas Linke
2002 Lecture Notes in Computer Science  
constraints into normal logic programs, which is exponential in the worst case.  ...  This allows for a structural analysis of programs. grounder parser computing block graph compilation coloring visualizing block graph output Fig. 1 . The architecture of noMoRe.  ... 
doi:10.1007/3-540-45757-7_46 fatcat:iollt2vve5hu3eybb7t54wi5tq

Integrating Logic Programming and Production Systems in Abductive Logic Programming Agents [chapter]

Robert Kowalski, Fariba Sadri
2009 Lecture Notes in Computer Science  
In this paper we argue the case for integrating the distinctive functionalities of logic programs and production systems within an abductive logic programming agent framework.  ...  The semantics and proof procedures are based on abductive logic programming, in which logic programs are integrated with integrity constraints that behave like production rules.  ...  logic-based semantics with an operational semantics that operates with the current state of a destructively changing database.  ... 
doi:10.1007/978-3-642-05082-4_1 fatcat:btdhdr5b5rg5favxoixqz2e534

Book announcements

1993 Discrete Applied Mathematics  
The equations for a limb analysis. Chord dominance. Limb analysis, summarized. Nonlinear networks. A contraction mapping result. A more general fixed point theorem.  ...  Constraints. The plausibility of a constraint. Plausibility states. The nature of evidence in TPD. Plausibility statements. The logic of plausibility states.  ... 
doi:10.1016/0166-218x(93)90173-l fatcat:l4psazjvkjcm5ksswvubyespla
« Previous Showing results 1 — 15 out of 58,076 results