14,473 Hits in 3.5 sec

Page 4890 of Mathematical Reviews Vol. , Issue 95h [page]

1995 Mathematical Reviews  
General techniques are de- scribed for extending model, fixpoint, and proof-theoretic charac- terizations of an arbitrary semantics of normal disjunctive logic programs to cover the class of extended programs  ...  Illustrations of these techniques are given for stable models, disjunctive well- founded and stationary semantics.  ... 

Solving large combinatorial problems in logic programming

Mehmet Dincbas, Helmut Simonis, Pascal Van Hentenryck
1990 The Journal of Logic Programming  
Aggoun for many fruitful discussions, and J.C. Madre and A. Daviaud from BULL systemes for giving us the data concerning the microcode generation problem.  ...  Constraint programming emphasizes local value-propagation techniques combined with a demon-driven computation [23, techniques include search algorithms like forward checking and lookahead [13] as well  ...  CHIP shows that logic-programming systems can be extended by constraint-solving techniques and sophisticated search procedures, providing a powerful problemsolving tool for a wide range of application  ... 
doi:10.1016/0743-1066(90)90052-7 fatcat:dbdvdqugyfcgrknf552k5x6owi

Programming Deep Concurrent Constraint Combinators [chapter]

Christian Schulte
1999 Lecture Notes in Computer Science  
Constraint combination methods are essential for a flexible constraint programming system.  ...  It introduces primitives and techniques needed to program constraint combinators from computation spaces.  ...  Disjunction This section shows how to program disjunctive combinators that resolve their alternatives by propagation rather than by search.  ... 
doi:10.1007/3-540-46584-7_15 fatcat:r72jlydb6jggbjag3xas7voj5u

Learning Logic Programs with Annotated Disjunctions [chapter]

Fabrizio Riguzzi
2004 Lecture Notes in Computer Science  
Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming.  ...  In this paper we propose an algorithm for learning LPADs.  ...  The author would like to thank Evelina Lamma and Luìs Moniz Pereira for many interesting discussions on the topic of this paper.  ... 
doi:10.1007/978-3-540-30109-7_21 fatcat:jfybil52xrfolouwjp6xcyetna

Disjunction and modular goal-directed proof search

Matthew Stone
2005 ACM Transactions on Computational Logic  
In particular, logically independent, local ambiguities will not interact in proof search.  ...  This paper explores goal-directed proof search in first-order multi-modal logic. I focus on a family of modal logics which offer the expressive power to specify modular goals and local assumptions.  ...  Thorne McCarty, Mark Steedman, Rich Thomason, and three anonymous reviewers for extensive comments, and to Jean Gallier, Aravind Joshi, Dale Miller and Scott Weinstein, who also encouraged this work in  ... 
doi:10.1145/1071596.1071599 fatcat:xwwfmwjlejevdeih4u7o3jt6vm

Page 1907 of Mathematical Reviews Vol. , Issue 97C [page]

1997 Mathematical Reviews  
The technique is based on a search for common structural regularities of saturations of the given positive examples, and is implemented in a system TIM.  ...  logic programming: propositional case.  ... 

Forthcoming Papers

2002 Artificial Intelligence  
Our comparison focuses on two backtracking algorithms that maintain a local consistency property at each node in their search tree: the forward checking and maintaining arc consistency algorithms.  ...  We first compare local consistency techniques such as arc consistency in terms of their inferential power when they are applied to the original (non-binary) formulation and to each of its binary transformations  ...  You, Abduction in logic programming: A new definition and an abductive procedure based on rewriting A long outstanding problem for abduction in logic programming has been on how minimality might be defined  ... 
doi:10.1016/s0004-3702(02)00281-3 fatcat:6gorcgplazbgtpkw4sdr7oajwa

Page 8089 of Mathematical Reviews Vol. , Issue 99k [page]

1999 Mathematical Reviews  
Our parallel prune-and-search technique also leads to efficient EREW PRAM algorithms for other problems, and is likely to be useful in solving other problems.”  ...  Sequentially, this problem was solved optimally in linear time by Megiddo and Dyer using the elegant prune-and-search technique.  ... 

Constraint logic programming for examination timetabling

P Boizumault, Y Delon, L Peridy
1996 The Journal of Logic Programming  
Finally, we illustrate the important potentialities of constraint logic programming for the prototyping and implementation of real-life applications.  ...  Then we describe the examination timetabling problem for our university and show how constraint logic programming over finite domains can be used to solve it efficiently.  ...  A BRIEF OVERVIEW OF CLP(FD) Constraint logic programming languages over finite domains such as CHIP [12, 14, 28] or clp(FD) [15] use constraints solving and local consistency techniques inherited from  ... 
doi:10.1016/0743-1066(95)00100-x fatcat:lfrs5arexzcnpabotn7qm4t2sa

Design, implementation, and evaluation of the constraint language cc(FD)

Pascal Van Hentenryck, Vijay Saraswat, Yves Deville
1998 The Journal of Logic Programming  
In addition, a small cc(FD) program was able to ®nd the optimal solution and prove optimality to a famous 10/10 disjunctive scheduling problem [29] , which was left open for more than 20 years and ®nally  ...  the cc framework [33] , an extension of the Constraint Logic Programming (CLP) scheme [21] .  ...  For instance, a logical and-gate using local propagation techniques would be: and(X,Y,Z):- X~ 0 3 Z~ 0, Y~ 0 3 Z~ 0, Z~ 1 3 (X~ 1, Y~ 1), X~ 1 3 Y~ Z, Y~ 1 3 X~ Z, X~ Y 3 X~ Z.  ... 
doi:10.1016/s0743-1066(98)10006-7 fatcat:6ziavlffungwzfbcbmkuimk2le

Guest editorial: special issue on Inductive Logic Programming

Stephen Muggleton, Ramon Otero, Simon Colton
2007 Machine Learning  
Two of the papers are related to search in ILP. Firstly, a novel stochastic search technique is investigated in the paper, "QG/GA: A Stochastic Search for Progol" (Muggleton and Tamaddoni-Nezhad).  ...  This special issue is associated with the 16th International Conference of Inductive Logic Programming (ILP 2006), which represented a radical departure from previous years.  ...  The paper "ALLPAD: Approximate Learning of Logic Programs with annotated Disjunctions" (Riguzzi) describes an algorithm for learning Logic Programs with Annotated Disjunctions (LPADs).  ... 
doi:10.1007/s10994-007-5036-4 fatcat:m5kfm7qwwneb3ibfnnbl73qlam

Parameter and Structure Learning Algorithms for Statistical Relational Learning

Elena Bellodi, Fabrizio Riguzzi
2012 International Conference of the Italian Association for Artificial Intelligence  
., Probabilistic Logic Programs,Probabilistic Horn Abduction,PRISM [16] , Independent Choice Logic,pD,Logic Programs with Annotated Disjunctions (LPADs) [17] , ProbLog [5] and CP-logic.  ...  The technique applied exploits the EM (Expectation Maximization) algorithm over BDDs proposed in [9, 8] and has been implemented in the system EMBLEM, for "EM over BDDs for probabilistic Logic programs  ... 
dblp:conf/aiia/BellodiR12 fatcat:p3mywvavxbbr7im6ht2k6vnlye

Page 2399 of Mathematical Reviews Vol. , Issue 96d [page]

1996 Mathematical Reviews  
It avoids the search for eureka definitions which is often required by other techniques proposed in the litera- ture.  ...  extended to the class of all disjunctive logic programs.  ... 

Page 8159 of Mathematical Reviews Vol. , Issue 2004j [page]

2004 Mathematical Reviews  
semantics for disjunctive programs).  ...  While the negation-as-failure is based on the existence of a finite, failed search tree for the negated goal (in the logic program), the failure of reduction is based on the logical interpretation of nega  ... 

Encapsulated search and constraint programming in Oz [chapter]

Christian Schulte, Gert Smolka, Jörg Würtz
1994 Lecture Notes in Computer Science  
Currently, there are the following research areas at the DFKI: 2 Intelligent Engineering Systems 2 Intelligent User Interfaces 2 Computer Linguistics 2 Programming Systems 2 Deduction and Multiagent Systems  ...  From its beginning, the DFKI has provided an attractive working environment for AI researchers from Germany and from all over the world.  ...  Acknowledgements We thank Michael Mehl, Tobias M uller, Konstantin Popov, and Ralf Scheidhauer for discussions and implementing Oz. We also thank Sverker Janson for discussions of search issues.  ... 
doi:10.1007/3-540-58601-6_96 fatcat:bv7kfn44tbcw5ijhemrtvnn6z4
« Previous Showing results 1 — 15 out of 14,473 results