• No results found

Logic Programs

Rough Description Logic Programs

Rough Description Logic Programs

... description logic programs (or simply rough dl-programs) under the answer set semantics, which can model uncertain, inexact information, and can deal with non monotonic reasoning at the same ...

7

A Framework for the Integration of Partial Evaluation and Abstract Interpretation of Logic Programs

A Framework for the Integration of Partial Evaluation and Abstract Interpretation of Logic Programs

... Another, strongly related work is [Pettorossi and Proietti 1996b], which uses an unfold/fold program transformation approach to specialise logic programs in a given context. This context is another ...

44

Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME

Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME

... tonic logic programs that will explain the behavior of XG- Boost trained ...inductive logic programming (ILP) algorithm capable of learning non- monotonic logic programs—that we apply ...

8

Learning to “Read Between the Lines” using Bayesian Logic Programs

Learning to “Read Between the Lines” using Bayesian Logic Programs

... Bayesian Logic Programs (BLPs) (Kersting and De Raedt, 2007), to learn probabilistic rules in first-order logic from a large corpus of extracted facts and then use the resulting BLP to make effective ...

10

Interval based Possibilistic Description Logic Programs for the Semantic Web

Interval based Possibilistic Description Logic Programs for the Semantic Web

... description logic programs, because crisp description logic programs cannot model uncertain and inconsistent ...possibilistic logic can represent and reason on uncertain, incomplete and ...

8

Logic Programs vs  First Order Formulas in Textual Inference

Logic Programs vs First Order Formulas in Textual Inference

... and logic programs—has its own ...of logic programs is nonmonotonic; this is crucial when background commonsense knowledge is expressed by defaults (note the word “normally” in the examples ...

6

Verifying termination and error-freedom of logic programs with block declarations

Verifying termination and error-freedom of logic programs with block declarations

... We present verification methods for logic programs with delay declarations. The verified prop- erties are termination and freedom from errors related to built-ins. Concerning termination, we present two ...

41

Strong Equivalence for Epistemic Logic Programs Made Easy

Strong Equivalence for Epistemic Logic Programs Made Easy

... Epistemic Logic Programs (ELPs), that is, Answer Set Pro- gramming (ASP) extended with epistemic operators, have re- ceived renewed interest in recent years, which led to a flurry of new research, as well ...

8

Batched Evaluation of Linear Tabled Logic Programs

Batched Evaluation of Linear Tabled Logic Programs

... The standard linear tabling mechanism uses a naive approach to evaluate tabled logic programs. Every time a new solution is found during the last round of evaluation, the complete search space for the ...

24

Incremental Computation of Success Patterns of Logic Programs

Incremental Computation of Success Patterns of Logic Programs

... of logic programs for stable ...of logic programs with respect to stable ab- stractions, a refinement operator that splits an equi- valence class induced by a coarser abstraction into a set of ...

10

Supervising Offline Partial Evaluation of Logic Programs using Online Techniques

Supervising Offline Partial Evaluation of Logic Programs using Online Techniques

... We have presented the idea of using online techniques in general and the homeomorphic embedding relation in particular to supervise an offline spe- cialiser, in an effort to help the development of correct annotations by ...

17

Learning Recursive Control Programs from Problem Solving

Learning Recursive Control Programs from Problem Solving

... Any method for learning teleoreactive logic programs or similar structures must address three issues. First, it must determine the structure of the hierarchy that decomposes problems into subproblems. ...

26

SQOPI: Semantic Query Optimization Framework

SQOPI: Semantic Query Optimization Framework

... Semantic query optimization uses semantic knowledge in databases to rewrite queries and logic programs for the purpose of more efficient query evaluation. There has been a large body of work in the area of ...

6

Specialising finite domain programs with polyhedra

Specialising finite domain programs with polyhedra

... The polyhedral analysis described in this paper develops the static analysis of con- straint logic programs outlined in [14]. However, the analysis in this paper is specifi- cally tailored to specialise ...

18

Neural-Symbolic Learning and Reasoning: Contributions and Challenges

Neural-Symbolic Learning and Reasoning: Contributions and Challenges

... propositional logic, a line of research which has since been substantially extended to other finitary logics (d’Avila Garcez, Lamb, and Gabbay ...predicate logic within neural networks using ...

5

Representing ontology mappings with probabilistic description logics programs

Representing ontology mappings with probabilistic description logics programs

... description logic programs under the answer set semantics as a language for representing and reasoning with un- certain and possibly inconsistent ontology ...disjunctive logic programs under ...

9

formal specification of PLC programs using temporal logic AIMTDR 1994

formal specification of PLC programs using temporal logic AIMTDR 1994

... predicate logic as a programming ...Prolog programs deal with predicates which are logical objects and Prolog programs are logical composition of ...PLC programs. We feel that PLC ...

7

PP 2007 11: 
  A Fully Connectionist Model Generator for Covered

PP 2007 11: A Fully Connectionist Model Generator for Covered

... first-order logic programs after train- ing, but all the extraction methods that we are aware of are ...of logic programs with that of inductive logic programming, but also to complete ...

6

Transforming general program proofs: a meta interpreter which expands negative literals

Transforming general program proofs: a meta interpreter which expands negative literals

... severely limits their application because many logic programs contain negation, including the real-world example described later in this paper. As far as these authors are aware (see Section 6), this is the ...

10

Program Semantics and Classical Logic

Program Semantics and Classical Logic

... a logic which is more expressive than the ones which are characteristically studied in that ...present logic can be viewed as a typed extension of Quantificational Dynamic Logic (QDL): see [14, 17] ...

33

Show all 10000 documents...

Related subjects