Skip to main content

Questions tagged [logic-programming]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
2 votes
0 answers
39 views

Are there any programming languages based on the method of analytic tableaux, aside from Fitting's Proflog?

The method of analytic tableaux [0] describes a process by which logical formulae, particularly of first order logic, can be determined to be valid or invalid. From the Wikipedia entry: A tableau ...
jpt4's user avatar
  • 101
8 votes
1 answer
359 views

In logic programming, what would a language with second-order model theory gain?

HiLog is described as a logic programming language with higher-order syntax, but first-order model theory. For example, it allows you to define a map over lists: ...
MWB's user avatar
  • 259
0 votes
1 answer
111 views

Probabilistic Logic Programming vs Stochastic Logic Programming

I'm reading the paper DeepStochLog: Neural Stochastic Logic Programming. The authors differentiate between Probabilistic Logic Programming (PLP) and Stochastic Logic Programming (SLP), but I can't ...
Pav's user avatar
  • 3
3 votes
1 answer
156 views

How to solve an unification problem on $\mathbb{N}$?

Usually, the unification problem for two given terms $t$ and $s$ is to find a substitution $\theta$ such that $\theta t = \theta s$, which is equal to finding the certain $\langle x_1 , \cdots , x_n \...
Kijeong Lim's user avatar
1 vote
2 answers
120 views

Determine if a structure is a model of an inductively defined predicate

My setting is first-order logic. As an example, consider an inductive definition of a linked list: $List(l)$ = $Null(l)$ $\vee~(Node(l) \wedge \exists sublist. List(sublist) \wedge next(l,...
sean's user avatar
  • 722
4 votes
1 answer
240 views

resolution based theorem prover for temporal logic

I am looking at implementing a a resolution-based theorem prover for propositional linear temporal logic (PLTL) (as opposed to a model checker). The ones out there (by Fisher et. al. and others) are ...
Motorhead's user avatar
  • 181
1 vote
1 answer
97 views

How to model degree variable in logic (new type of modal logic?)?

I am trying to model domain in logic (first order logic or some of modal logics) and I have variable which is degree and not true-false variable. There can be different conclusions depending on the ...
TomR's user avatar
  • 409
1 vote
1 answer
150 views

How to specify and verify Horn clauses (logic programming programs)? Semantics of Horn clauses

There are lot of applications of Horn clauses (notable examples include use of rules in cognitive architectures and knowledge bases, as well as use of rules in business rules programs). Are there ...
TomR's user avatar
  • 409
2 votes
0 answers
45 views

Abduction in a Herbrand Constraint System

I have a simple constraint system with a finite set $C$ of constant symbols, an infinite set $V$ of variables, and two relation symbols - $R_1$, a preorder, and $R_2$, an equivalence relation. ...
Gowtham Kaki's user avatar
2 votes
0 answers
89 views

How to select good examples for inductive logic programming?

I encounter a question while reading Quinlan's 1990 paper "Learning Logical Definitions from Relations". He described that (section 5.2) for learning the recursive relations on lists, the ...
todpole3's user avatar
2 votes
2 answers
256 views

What is the formalism behind ?- (query) in Prolog?

I am in general interested in a more formal (better be logical, as in related to mathematical logic) definition of a query. As an example, there's Prolog operator ...
wvxvw's user avatar
  • 167
-1 votes
1 answer
166 views

Consistency and completeness of any arbitrary 3-valued logic? [closed]

Based on the explanations here [1] I know that 3-valued first order logic has many different versions, which differ in the definition of their operations (e.g. implication). All of these (as far as I ...
Daniel's user avatar
  • 749
2 votes
1 answer
739 views

Three-valued logic solver?

This is not my area, so apologizes if I am asking nonsense! I know that there are very good solver/theorem provers for solving 1st order logic. Now I have a problem, using 3-valued logic, but I am ...
Daniel's user avatar
  • 749
7 votes
3 answers
340 views

Completeness of the extension of first order logic with least fixed point order operator

Is there any result about the extension of first order logic with least fixed point operator, being complete (as logic in general on infinite structures too) or not? In other words does the Goedel ...
Constantine Kyritsis's user avatar
2 votes
1 answer
370 views

What is logic programming and does it really add anything new to the logic?

I am acquinted with the basics of such notions as logic programming, monotonic and non-monotonic reasoning, modal logic (especially dynamic logic) and now I am wondering - does logic programming ...
TomR's user avatar
  • 409
1 vote
1 answer
124 views

Is there good open source project that apply semantic web, modal logics, and similar technologies

Recently such themes as semantic web, modal logics, business rules have seen increased interest as research topics in computer science (alhough many of then have more than 80 years of history), but ...
TomR's user avatar
  • 409
17 votes
3 answers
8k views

What is a practical non-von Neumann architecture?

Are there any practical applications for non-von Neumann programming models? What are the most widely adopted non-von Neumann programming languages?
Len Yabloko's user avatar
8 votes
1 answer
589 views

Papers on Prolog-like languages without closed world assumption (CWA)

Prolog execution process may be seen as a search that model scientific search for a proof of a proposition. At the same time, real world scientific search greatly differs from Prolog search in the ...
user1123502's user avatar
4 votes
2 answers
449 views

Minimize a datalog program

We can consider a datalog program as a set of clauses. Some of them allow to derive others. For instance from: A(x) :- B(x), C(x). B(x) :- D(x). C(x) :- D(x). We ...
Trylks's user avatar
  • 604
2 votes
1 answer
252 views

Recommendation for a good book on first order logic w.r.t inductive logic programming

I have had 10 days to read up on Computational Logic but the books I am following are only succeeding in confusing me. I find most of text's ( Niehuys-Cheng & de Wolf 1997, De Raedt 2008, Lloyd ...
Samrat Roy's user avatar
9 votes
2 answers
366 views

DATALOG references

What are the best references for self study in DATALOG? I am particularly interested in expressive power, complexity results, evaluation methods, extensions of DATALOG with negation etc. Are there any ...
Ariadne's user avatar
  • 93
8 votes
2 answers
464 views

Logic Programming: Transforming B:-A C:-A to B,C:-A

I hope I've come to the right place... it's (probably) a fairly straightforward Logic Programming question. If I have two clauses of the form: B:-A C:-A I can ...
badroit's user avatar
  • 225
15 votes
2 answers
1k views

Difference lists in functional programming

The question What's new in purely functional data structures since Okasaki?, and jbapple's epic answer, mentioned using difference lists in functional programming (as opposed to logic programming), ...
Rob Simmons's user avatar
  • 2,396