The paper featuresMAVE, a knowledge-based system for answer validation through deep linguistic processing and logical inference. A relaxation loop is used to determine a robust indicator of logical entailment. The system not only validates answers directly, but also gathers evidence by proving the original question and comparing results with the answer candidate. This method boosts recall by up...

Christine Ladd-Franklin is often hailed as a guiding star in the history of women logic—not only did she study under C. S. Peirce and was one first to receive PhD from Johns Hopkins, also, according many modern commentators, solved logical problem which had plagued field syllogisms since Aristotle. In this paper, we revisit claim, posing answering two distinct questions: Which solve her thesis,...

We propose a novel method of determining the appropriateness of an answer to a question through a proof of logical relevance rather than a logical proof of truth. We define logical relevance as the idea that answers should not be considered as absolutely true or false in relation to a question, but should be considered true more flexibly in a sliding scale of aptness. This enables us to reason ...

Logic programs with ordered disjunction (LPODs) add a new connective to logic programming. This connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: A×B intuitively means: if possible A, but if A is not possible, then at least B. The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. In thi...

The combination of data, semantics, and the Web has led to an ever growing and increasingly complex body of semantic data. Accessing such structured data requires learning formal query languages, such as SPARQL, which poses significant difficulties for non-expert users. Many existing interfaces for querying Ontologies are based on approaches that rely on predefined templates and require expensi...

James Sterba uses the Pauline Principle to argue that occurrence of significant, horrendous evils is logically incompatible with existence a good God. The states (as rule) one must never do evil so may come from it, and according Sterba, this principle implies God not permit significant even if permission would be necessary secure other, greater goods. By contrast, I compatible because victims ...

There are problems related to question answering which obviously call for semantically based logical inferences. For example, a question-answering system should produce the same answer if asked with logically equivalent paraphrases of a question. Moreover, an answer should not only be found for direct matches of the query with the knowledge base but also if the answer is entailed by the latter....

We present a logical framework to represent and reason about fuzzy optimization problems based on fuzzy answer set optimization programming. This is accomplished by allowing fuzzy optimization aggregates, e.g., minimum and maximum in the language of fuzzy answer set optimization programming to allow minimization or maximization of some desired criteria under fuzzy environments. We show the appl...

Suppose we want to build a system that answers a natural language question by representing its semantics as a logical form and computing the answer given a structured database of facts. The core part of such a system is the semantic parser that maps questions to logical forms. Semantic parsers are typically trained from examples of questions annotated with their target logical forms, but this t...