imone de Beauvoir recalls that when she first made the acquaintance of Jean-Paul Sartre he, then still a young man, proudly and somewhat hubristically declared that when he became older he wanted to be Stendhal and Spinoza (Cérémonie 182, 228). Not satisfied with the dream of being merely a great writer or a great philosopher, Sartre hoped to pursue both academic vocations at the same time. For...

We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesis conjectures. We also discuss novel counterexample-guided techniques for quantifier instantiation that we use to make finding such proofs practically feasible. A particularly important class of spec...

the problem of “imagination”, as raised by muslimphilosophers, has several epistemic consequences insubjects as diverse as ontology, prophecy,conceptualization and the functions of art. inilluminationist philosophy of suhrawardi, moreover, bearsthe topic of imagination a correlation to other subjects. ofthe foundations of suhrawardi's processing of the theoryof imagination, the most promin...

This study investigated the effect of refutation text structure on reading processes and learning. Undergraduate biology students ( n = 116) who had high or moderate misconceptions were randomly assigned to read either a non-refutation text, simple an elaborated that addressed commonly held about genetic biology. Participants’ prompted think-aloud type their thoughts as they text. Typed verbal ...

Dharmakīrti refutes the reality of relation （sambandha） in his Sambandhaparīkṣā （SP）. In first and third verses, pāratantrya parāpekṣā as definitions relation. The two words are so synonymous that it is difficult to distinguish them based on verses alone. To clarify exact meaning words, this paper investigates Dharmakīrti’s usages thereof works well those Buddhist non-Buddhist commentaries SP. ...

Let F ( n; n) denote a random CNF formula consisting of n randomly chosen 2-clauses and n randomly chosen 3-clauses, for some arbitrary constants ; 0. It is well-known that, with probability 1 o(1), if > 1 then F ( n; n) has a linear-size resolution refutation. We prove that, with probability 1 o(1), if < 1 then F ( n; n) has no subexponential-size resolution refutation. Our result also yields ...

Because of several technological limitations of traditional silicon based computing, for past few years a paradigm shift, from silicon to carbon, is occurring in computational world. DNA computing has been considered to be quite promising in solving computational and reasoning problems by using DNA strands. Resolution, an important aspect of automated theorem proving and mathematical logic, is ...

One of the main disadvantages of computer generated proofs of mathematical theorems is their complexity and incomprehensibility. Proof transformation proce-­ dures have been designed in order to state these proofs in a formalism that is more familiar to a human ma-­ thematician. But usually the essential idea of a proof is still not easily visible. We describe a procedure to transform proofs re...

This paper describes a class of decision procedures that we have found useful for efficient, domain-specific deductive synthesis, and a method for integrating this type of procedure into a general-purpose refutation-based theorem prover. We suggest that this is a large and interesting class of procedures and show how to integrate these procedures to accelerate a general-purpose theorem prover d...