First order predicate logic - artificial intelligence, Computer Engineering

First Order Predicate Logic :

This is a more expressive logic because it is mostly builds on propositional logic by allowing us to needs as constants, variables, predicates, functions and quantifiers in addition to the connectives we've already seen. For instance, in the sentence like: "Every Monday and Wednesday I go to John's house for dinner" can be written in first order predicate logic as:

∀X ((day_of_week(X, monday) ∨ day_of_week(X, wednesday))
→ (go_to(me, house_of(john)) ^ eat_meal(me, dinner))).

Hence there, the symbols monday, wednesday, me, dinner and john are all constants: base-level objects in the world about that we want to talk. There is the symbols of day_of_week, go_to and eat_meal are predicates that is represent relationships between the arguments that can be appear inside the brackets. For example we see that in eat_meal the relationship justify that a person's first argument eats a particular meal (second argument). Moreover, we have represented the fact in which me eats dinner. The symbol X is a variable, that can take on a range of values. This enables us to be much more expressive, and in particular, we can just quantify X with the 'for all' ∀ symbol, so that our sentence of predicate logic talks about all possible X's. And finally, the symbol of house_of is a function, and - if we can - we are just expected to swap house_of(john) with the output of the function (john's house) given the input to the function (john).

The syntax and semantics both are predicate of logic and they are covered in much more detail as part of the lectures on automated reasoning.

 

Posted Date: 1/10/2013 4:43:09 AM | Location : United States







Related Discussions:- First order predicate logic - artificial intelligence, Assignment Help, Ask Question on First order predicate logic - artificial intelligence, Get Answer, Expert's Help, First order predicate logic - artificial intelligence Discussions

Write discussion on First order predicate logic - artificial intelligence
Your posts are moderated
Related Questions
Simplify the given expressions using Boolean postulates Y = (A + B)(A‾ + C)(B + C) Ans. Y = (A + B)(A‾ + C)(B + C) = (A A‾ + AC + B A‾ + BC) (B + C) = (AC + B A‾ + BC) (B + C)

Q. Explain about Zip Drive? Zip Drive: Loads of files, Volumes of data have definitely increased onus on today's computer user and protection of this data is what bugs every

Analog signals can be              by combining them with a carrier frequency (A)  Carried                                      (B)  Transported (C)  Multiplexed

T he complexity of adding two matrices of order m*n is mn

Binary Constraints: Alternatively unary constraints specify that a particular variable can take certain values that basically restricts the domain for that variable thus shoul

Example Calculation: If we see an example we are working with a set of examples like S = {s 1 ,s 2 ,s 3 ,s 4 } categorised with a binary categorisation of positives and negati

Q. What is Parallel Loop Construct? Parallel loop construct is a shortcut for specifying parallel construct comprising one loop construct and no other statements. The syntax of

Parallelism based on Grain size Grain size : Grain size/ Granularity are a measure that defines how much computation is involved in a process. Grain size is concluded by count

What is meant by inferring latches, how to avoid it? Consider the following: always @(s1 or s0 or i0 or i1 or i2 or i3) case ({s1, s0}) 2'd0: out = i0; 2'd1: out =

What are the advantages of code optimization? Code optimization tends at enhancing the execution efficiency of a program. It is achieved in two manners. Redundancies in a progr