Queries against databases are formulated in declarative languages. Examples are the relational query language SQL and XPath or XQuery for querying data stored in XML. Using a declarative query language, the querist does not need to know about or decide on anything about the actual strategy a system uses to answer the query. Instead, the system can freely choose among the algorithms it employs t...

In this paper we argue that questionanswering (QA) over technical domains is distinctly different from TREC-based QA or Web-based QA and it cannot benefit from data-intensive approaches. Technical questions arise in situations where concrete problems require specific answers and explanations. Finding a justification of the answer in the context of the document is essential if we have to solve a...

Jan Kraj cek posed the following problem: Is there is a generalization result in the theory of real closed elds of the form: If A(1 + + 1) (n occurrences of 1) is provable in length k for all n 2 !, then (8x)A(x) is provable? It is argued that the answer to this question depends on the particular formulation of the \theory of real closed elds." Four distinct formulations are investigated with r...

RAVE (Real-time Answer Validation Engine) is a logic-based answer validator/selector designed for application in real-time question answering. RAVE uses the same toolchain for deep linguistic analysis and the same background knowledge as its predecessor (MAVE), which took part in the AVE 2007. However, a full logical answer check as in MAVE was not considered suitable for real-time answer valid...

In his 1918 logical atomism lectures, Russell argued that there are no molecular facts. But he posed a problem for anyone wanting to avoid facts: we need truth-makers generalizations of formulas, but such seem be both unavoidable and have an abominably character. Call this the generalized formulas. I clarify here by distinguishing two kinds formula: incompletely formulas completely next argue t...

The answer set semantics may assign a logic program no model due to classic contradiction or cyclic negation. The latter can be remedied by a paracoherent semantics given by semi-equilibrium (SEQ) models, which are 3-valued interpretations that generalize the logical reconstruction of answer sets given by equilibrium models. However SEQ-models miss modularity in the rules, such that a natural m...

A computer-mediated teaching system, called computer-aided personalized system of instruction (CAPSI), has been developed that incorporates a social constructivist approach. This educational philosophy maintains that human learning occurs primarily through a socially interactive process. In CAPSI, course material is divided into study units, and the instructor prepares study questions on each u...

Event tracing and monitoring of parallel applications are difficult if each processor has its own unsynchronized clock. A survey is given on several strategies to generate a global time, and their limits are discussed. The controlled logical clock is a new method based on Lamport’s logical clock and provides a method to modify inexact timestamps of tracefiles. The new timestamps guarantee the c...

This paper will examine the motivations behind Jan Łukasiewicz’s rejection of principle bivalence. In particular, relationship between category possibility and logical value judgements be examined. is clearly linked to view determinism/ indeterminism controversy presented by Łukasiewicz. The close with remarks on statute an attempt answer question whether approach can treated as something more ...