ShyPerson
  • Member for 9 years, 9 months
  • Last seen this week
What is the purpose of learning propositional logic
Accepted answer
5 votes

Briefly, one can't learn AI without it. Some of the main content areas of AI are based on logic: knowledge representation, planning, natural language semantics and reasoning. Have a look at the ...

View answer
Can someone clarify this unification algorithm?
Accepted answer
5 votes

First, unification algorithms are tricky. Studying other textbooks will help. Second, things will probably get clearer if you look at actual code implementations. Have a look at the online code ...

View answer
Addition, multiplication, and apostrophe used to represent boolean algebra expressions?
Accepted answer
4 votes

Usually $+$ means $\lor$, "multiplication" means $\land$, and $'$ means $\lnot$.

View answer
Subtlety of a bar in introduction rule
4 votes

Let's try an example. Let's say you're trying to prove the following: Simple Theorem over the natural numbers: If $n$ is even, then $n+1$ is odd. What he's trying to say is that you don't need an ...

View answer
Which is the equivalent processing of human brain in terms of computer processing?
4 votes

Ralph Merkle, a computer scientist at Xerox PARC, published a paper in 1989 evaluating intellectual processing power. He measured it in three different ways. Method One: There are about 1 quadrillion ...

View answer
What algorithms for unification over (multidimensional) array terms?
Accepted answer
2 votes

By way of context, I'll assume the goal is to do unification in classical first-order logic in a fixed language $\mathscr{L}$. (Formatting and other corrections welcome.) Briefly, you can treat ...

View answer
Complexity of natural language processing problems
Accepted answer
2 votes

LFG (Lexical-Functional Grammar) recognition is NP-Complete. Edit per request: Lexical-Functional Grammar (LFG) [1] is a theory of natural language syntax, developed as an alternative to Chomsky's ...

View answer
Natural Languages
Accepted answer
1 votes

See this paper for an extended discussion which includes the old Chomskyan center-embedding arguments that English, for example, is not regular. See this answer for an argument that natural languages ...

View answer
Consistent theory based on L and not(A->A) is a theorem
1 votes

I'll assume that we're working in the context of classical propositional logic. The first thing to point out is that $\lnot(A \rightarrow A)$ leads to a contradiction: ($A \land \lnot A$). Since ...

View answer
How to conceptually represent attributes (characteristics) of an object in logics?
1 votes

For this discussion, I'll use classical first-order logic. I'll interpret your term "first-class citizens" to mean those objects which can be quantified over or passed as arguments to predicates and ...

View answer
NLP - Deep belief neural networks or logic?
Accepted answer
1 votes

Very briefly: Option 1 faces difficulties since certain connectionist models are incapable of learning natural languages. Option 2 faces grave difficulties due to many negative results, notably ...

View answer
proving program equivalence
0 votes

One general approach to the problem is to prove program equivalence by showing the programs have the same semantics. Hoare-style verification, as you say, is one option categorized as axiomatic ...

View answer
Why there is forward chaining inference engine (reasoner) for description logics only and not for other logics?
0 votes

Section 9.3.2 of the leading artificial intelligence textbook contains a sketch implementation of a forward chaining inference engine.

View answer