3401_W12_assignment1

3401_W12_assignment1 - York University- CSE 3401- Winter...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Page: 1 York University- Department of Computer Science and Engineering SC/CSE 3401 3.00 – Functional and Logic Programming Assignment 1 1) This assignment is due on January 30, 2012 at 3:30pm in course drop box 2) Please provide your first name, last name and student number on the first page of your assignment. 3) Review policy on academic honesty. The submitted assignment must be each individual's own work. 4) NO LATE ASSIGNMENTS! 1) (8 marks) Consider the following formulae: ) ( : : ) ( : r p q C r q B r q p A ¬ a) Using truth tables, which of the above formulae is satisfiable? b) Which of the above formulae is a contradiction? c) Which of the following sets are satisfiable? a. {A, B} b. {B, C} c. {A, B, C} d) Which of the above sets i-iii are inconsistent? Explain your answers. 2) (5 marks) Consider the following formula in domain of natural numbers: ) 5 1 )( )( ( = + > x y x y x In this formula, (a) List all object variables and constants. (b) What are the predicates? What are the functions?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/14/2012 for the course CSE 3401 taught by Professor Movahedi during the Fall '11 term at York University.

Page1 / 3

3401_W12_assignment1 - York University- CSE 3401- Winter...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online