StackOverflow Questions for Tag: first-order-logic

Hamza TAOURIRT

Reputation: 21

TweetyProject for first order logic

javaartificial-intelligencefirst-order-logic

Score: 2

Answers: 1

Shore

Reputation: 1033

What is the normal procedure of z3 handle axiom with quantifier?

z3smtfirst-order-logicsatisfiability

Score: 0

Answers: 0

Patrick Browne

Reputation: 253

Understanding universal restriction of a concept in Description Logic (DL)

first-order-logicdescription-logic

Score: 2

Answers: 1

Joseph Vidal-Rosset

Reputation: 167

DCG LaTeX printer for FOL prover

prologlatexlogicswi-prologfirst-order-logic

Score: 2

Answers: 1

ndrini

Reputation: 103

Bad Result with NLTK's ResolutionProver in FOL (Python)

nltkinferencefirst-order-logic

Score: 0

Answers: 0

Luca Sabatucci

Reputation: 3

Scala Parser Combinators issue with whitespaces

scalaparsingfirst-order-logic

Score: 0

Answers: 1

Theo Deep

Reputation: 786

Searching Skolem functions in non-linear arithmetics

z3smtquantifiersfirst-order-logic

Score: 0

Answers: 1

user20677792

Reputation:

Counterexample for first-order logic assertion

logicprooffirst-order-logic

Score: 1

Answers: 1

user49413

Reputation: 1

Gödel didn’t prove the incompleteness?

logicprooffirst-order-logic

Score: 0

Answers: 0

Theo Deep

Reputation: 786

If a theory is decidable in the existential fragment, does this mean that there is a (terminating) method to obtain witnesses of satisfaction?

z3smtquantifiersfirst-order-logic

Score: 0

Answers: 1

Theo Deep

Reputation: 786

I think Z3 is not performing quantifier elimination in a sequence instance

z3smtz3pyquantifiersfirst-order-logic

Score: 0

Answers: 1

Theo Deep

Reputation: 786

Can I use quantifier elimination to get models for 'c' in formulae like ∃a.∀b.∃c.∀d. Phi?

z3smtquantifiersfirst-order-logic

Score: 0

Answers: 1

Theo Deep

Reputation: 786

How can I perform validity of ∃∀.φ, if I use quantifier elimination for ∀.φ and get φ'? I hypothetise ∃φ' solves satisfiability, not validity

z3z3pyquantifiersfirst-order-logicsatisfiability

Score: 0

Answers: 1

Jason

Reputation: 13

Can SMT solver like Z3 prove 1+2+...+n = n(n+1)/2?

mathz3smtfirst-order-logictheorem

Score: 1

Answers: 1

David Yi

Reputation: 63

What are `lexpr` and `ApplicationExpression` nltk?

pythonnlpnltksemanticsfirst-order-logic

Score: -4

Answers: 2

Is_Show

Reputation: 1

How do you prove ∃x[Fx → (Gx → Hx)], ∀xFx ∧ ∃xGx ∴ ∃x¬(Gx ∧ ¬Hx) in FOL?

logicfirst-order-logic

Score: 0

Answers: 1

Dragoș Constantin

Reputation: 1

How would you go about implementing this example of Resolution in Prolog?

prologfirst-order-logic

Score: 0

Answers: 1

Vivek Joshy

Reputation: 934

How do I write the lark grammar for First Order Logic with Equality?

pythonparsingbnffirst-order-logiclark-parser

Score: 0

Answers: 2

Tianwei

Reputation: 1

How can I show that if a theory T is closed under extension, then it can be axiomatised using existential sentences?

logicfirst-order-logic

Score: 0

Answers: 0

Theo Deep

Reputation: 786

Does Z3 (and other solvers) always use terminating decision procedures when possible?

arraysz3smttheorem-provingfirst-order-logic

Score: 0

Answers: 1

PreviousPage 1Next

StackOverflow Questions for Tag: first-order-logic

TweetyProject for first order logic

What is the normal procedure of z3 handle axiom with quantifier?

Understanding universal restriction of a concept in Description Logic (DL)

DCG LaTeX printer for FOL prover

Bad Result with NLTK&#39;s ResolutionProver in FOL (Python)

Scala Parser Combinators issue with whitespaces

Searching Skolem functions in non-linear arithmetics

Counterexample for first-order logic assertion

G&#246;del didn’t prove the incompleteness?

If a theory is decidable in the existential fragment, does this mean that there is a (terminating) method to obtain witnesses of satisfaction?

I think Z3 is not performing quantifier elimination in a sequence instance

Can I use quantifier elimination to get models for &#39;c&#39; in formulae like ∃a.∀b.∃c.∀d. Phi?

How can I perform validity of ∃∀.φ, if I use quantifier elimination for ∀.φ and get φ&#39;? I hypothetise ∃φ&#39; solves satisfiability, not validity

Can SMT solver like Z3 prove 1+2+...+n = n(n+1)/2?

What are `lexpr` and `ApplicationExpression` nltk?

How do you prove ∃x[Fx → (Gx → Hx)], ∀xFx ∧ ∃xGx ∴ ∃x&#172;(Gx ∧ &#172;Hx) in FOL?

How would you go about implementing this example of Resolution in Prolog?

How do I write the lark grammar for First Order Logic with Equality?

How can I show that if a theory T is closed under extension, then it can be axiomatised using existential sentences?

Does Z3 (and other solvers) always use terminating decision procedures when possible?

Bad Result with NLTK's ResolutionProver in FOL (Python)

Gödel didn’t prove the incompleteness?

Can I use quantifier elimination to get models for 'c' in formulae like ∃a.∀b.∃c.∀d. Phi?

How can I perform validity of ∃∀.φ, if I use quantifier elimination for ∀.φ and get φ'? I hypothetise ∃φ' solves satisfiability, not validity

How do you prove ∃x[Fx → (Gx → Hx)], ∀xFx ∧ ∃xGx ∴ ∃x¬(Gx ∧ ¬Hx) in FOL?