Filters








8,908 Hits in 3.0 sec

Logic Programs with Annotated Disjunctions [chapter]

Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe
2004 Lecture Notes in Computer Science  
doi:10.1007/978-3-540-27775-0_30 fatcat:gqze6prxbjfyxpiakglf5yqvom

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.  ...  The learning problem we consider consists in starting from a sets of interpretations annotated with their probability and finding one (or more) LPAD that assign to each interpretation the associated probability  ...  One of the most recent approaches is Logic Programs with Annotated Disjunctions (LPADs) presented in [22, 21] .  ... 
doi:10.1007/978-3-540-30109-7_21 fatcat:jfybil52xrfolouwjp6xcyetna

Approximate Inference for Logic Programs with Annotated Disjunctions [chapter]

Stefano Bragaglia, Fabrizio Riguzzi
2011 Lecture Notes in Computer Science  
Logic Programs with Annotated Disjunctions (LPADs) are a promising language for Probabilistic Inductive Logic Programming.  ...  and Monte Carlo. k-Best finds a lower bound of the probability of a query by identifying the k most probable explanations while Monte Carlo estimates the probability by smartly sampling the space of programs  ...  A Logic Programs with Annotated Disjunctions T [6] consists of a finite set of disjunctive clauses of the form (H 1 : α 1 ) ∨ (H 2 : α 2 ) ∨ . . . ∨ (H n : α n ) ← B 1 , B 2 , . . .  ... 
doi:10.1007/978-3-642-21295-6_7 fatcat:xhxbwpwbxndxtcvoebilw64i5a

ALLPAD: approximate learning of logic programs with annotated disjunctions

Fabrizio Riguzzi
2007 Machine Learning  
Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for representing probabilistic knowledge in logic programming.  ...  In this paper we consider the problem of learning ground LPADs starting from a set of interpretations annotated with their probability. We present the system ALLPAD for solving this problem.  ...  Preliminaries A Logic Program with Annotated Disjunctions P consists of a finite set of formulas of the form (h 1 : p 1 ) ∨ (h 2 : p 2 ) ∨ · · · ∨ (h n : p n ) ← b 1 , b 2 , . . . b m called annotated  ... 
doi:10.1007/s10994-007-5032-8 fatcat:vyqotufr3nbnrcddxv3tk5kbza

Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions

Fabrizio Riguzzi, Terrance Swift, Marc Herbstritt
2010 International Conference on Logic Programming  
One such proposal, Logic Programming with Annotated Disjunctions (LPADs) represents probabilistic information in a sound and simple way.  ...  Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms.  ...  Logic Programs with Annotated Disjunctions A Logic Program with Annotated Disjunctions [20] consists of a finite set of annotated disjunctive clauses of the form h 1 : α 1 ∨ . . . ∨ h n : α n ← b 1 ,  ... 
doi:10.4230/lipics.iclp.2010.162 dblp:conf/iclp/RiguzziS10 fatcat:ih7ctzjukzab7b5lqhu7bumgcy

The Most Probable Explanation for Probabilistic Logic Programs with Annotated Disjunctions [chapter]

Dimitar Shterionov, Joris Renkens, Jonas Vlasselaer, Angelika Kimmig, Wannes Meert, Gerda Janssens
2015 Lecture Notes in Computer Science  
Probabilistic logic languages, such as ProbLog and CP-logic, are probabilistic generalizations of logic programming that allow one to model probability distributions over complex, structured domains.  ...  In this work, we propose a new encoding of annotated disjunctions which allows correct MARG and MPE.  ...  with Annotated Disjunctions Annotated Disjunctions We recall annotated disjunctions as used in LPADs [3] and CP-Logic [12] .  ... 
doi:10.1007/978-3-319-23708-4_10 fatcat:pw2kbf6yvnavhbbzglehmor6dm

TABLING AND ANSWER SUBSUMPTION FOR REASONING ON LOGIC PROGRAMS WITH ANNOTATED DISJUNCTIONS

Fabrizio Riguzzi, Terrance Swift
2010 the International Conference on Logic Programming   unpublished
The paper presents the algorithm "Probabilistic Inference with Tabling and Answer subsumption" (PITA) for computing the probability of queries from Logic Programs with Annotated Disjunctions.  ...  PITA is based on a program transformation techniques that adds an extra argument to every atom.  ...  Logic Programs with Annotated Disjunctions A Logic Program with Annotated Disjunctions [Ven04] consists of a finite set of annotated disjunctive clauses of the form h 1 : α 1 ; . . . ; h n : α n ← b  ... 
fatcat:kcfwmi7zgrhzno766lvfj47kby

ALLPAD: Approximate Learning of Logic Programs with Annotated Disjunctions [chapter]

Fabrizio Riguzzi
Lecture Notes in Computer Science  
Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for representing probabilistic knowledge in logic programming.  ...  In this paper we consider the problem of learning ground LPADs starting from a set of interpretations annotated with their probability. We present the system ALLPAD for solving this problem.  ...  Preliminaries A Logic Program with Annotated Disjunctions P consists of a finite set of formulas of the form (h 1 : p 1 ) ∨ (h 2 : p 2 ) ∨ . . . ∨ (h n : p n ) ← b 1 , b 2 , . . . b m called annotated  ... 
doi:10.1007/978-3-540-73847-3_11 fatcat:lkuozcj4tfazzk7h4fhptolwfa

Fuzzy Aggregates in Fuzzy Answer Set Programming [article]

Emad Saad
2013 arXiv   pre-print
aggregates, and consequently subsumes the classical answer set semantics of classical disjunctive logic programs.  ...  However, the unavailability of fuzzy aggregates in disjunctive fuzzy logic programs, DFLP, with fuzzy answer set semantics prohibits the natural and concise representation of many interesting problems.  ...  Moreover, this fuzzy company control problem cannot be represented as a disjunctive fuzzy logic program with fuzzy answer set semantics either, since disjunctive fuzzy logic programs with fuzzy answer  ... 
arXiv:1304.1827v1 fatcat:k6oggx7kx5cfhnpsasdlzmjh6e

Paraconsistent disjunctive deductive databases

V.S. Subrahmanian
1992 Theoretical Computer Science  
We use the device of annotated atoms introduced by Blair and Subrahmanian (1987, 1988) to achieve this effect.  ...  Subrahmanian, Paraconsistent disjunctive deductive databases, Theoretical Computer Science 93 (1992) 115-141. Databases and knowledge bases could be inconsistent in many ways.  ...  A disjunctive annotated logic program (DALP) over Y is a finite set of disjunctive annotated clauses over r.  ... 
doi:10.1016/0304-3975(92)90214-z fatcat:l7gacwzjvbfnjo4do3yun36rl4

Logical Probability Preferences [article]

Emad Saad
2013 arXiv   pre-print
We show the application of probability answer set optimization programs to a variant of the well-known nurse restoring problem, called the nurse restoring with probability preferences problem.  ...  We present a unified logical framework for representing and reasoning about both probability quantitative and qualitative preferences in probability answer set programming, called probability answer set  ...  For the simplicity of the presentation, hybrid basic formulae that appearing in a disjunctive hybrid probability logic rule without probability annotations are assumed to be associated with the annotation  ... 
arXiv:1304.3144v1 fatcat:gwcdwzpmqjbrjlbxzguwucn3eq

Page 476 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
It is shown that a signed formula logic program, together with annotated logic, forms a paraconsistent basis for reasoning about ‘inconsistent’ multiple-valued logic programs.  ...  In this paper, the theory of logic programming based on signed formulas is developed, and its connection to annotated logic programming investigated.  ... 

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

2003 Mathematical Reviews  
Summary: “In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics.  ...  They are based on generalized annotated logic programming [M. Kifer and V. S. Subrahmanian, J.  ... 

Logical Fuzzy Preferences [article]

Emad Saad
2013 arXiv   pre-print
We show the application of fuzzy answer set optimization programs to the course scheduling with fuzzy preferences problem.  ...  We present a unified logical framework for representing and reasoning about both quantitative and qualitative preferences in fuzzy answer set programming, called fuzzy answer set optimization programs.  ...  Thus, this course scheduling with fuzzy preferences problem instance can be encoded as a fuzzy answer set program (a disjunctive fuzzy logic program with fuzzy answer set semantics) of the form teaches  ... 
arXiv:1304.2797v1 fatcat:zifpamspnzex7lqigqrq3fuy6e

A new approach to hybrid probabilistic logic programs

Emad Saad, Enrico Pontelli
2007 Annals of Mathematics and Artificial Intelligence  
This is not the case in the probabilistic annotated logic programming in general and the hybrid probabilistic programs framework in particular.  ...  In this paper, we extend the language of hybrid probabilistic programs by allowing disjunctive composition functions to be associated with heads of clauses and change its semantics to be more suitable  ...  Hybrid probabilistic programs are built upon the idea of annotated logic programs introduced in [31] , and extensively studied in [12, 13, 21, 24] .  ... 
doi:10.1007/s10472-007-9082-1 fatcat:kf7j7dd6gzgj5gvomj34c5v3pe
« Previous Showing results 1 — 15 out of 8,908 results