The tag has no wiki summary.

learn more… | top users | synonyms

-1
votes
1answer
74 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 ...
2
votes
1answer
149 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 ...
6
votes
3answers
143 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 ...
3
votes
1answer
257 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 ...
1
vote
1answer
86 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 ...
11
votes
3answers
3k 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?
4
votes
1answer
272 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 ...
4
votes
2answers
330 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 ...
2
votes
1answer
185 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 ...
8
votes
2answers
282 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 ...
8
votes
2answers
430 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 ...
13
votes
2answers
745 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), ...