HEX-programs extend ASP by external sources. In this paper, we present domain-specific existential quantifiers on top of HEX-programs, i.e., ASP programs with external access which may introduce new values that also show up in the answer sets. Pure logical existential quantification corresponds to a specific instance of our approach. Programs with existential quantifiers may have infinite groun...

The goal of originalism has always been purity. Originalists claim that their methods cleanse constitutional interpretation of politics, discretion, and indeterminacy. The key to attaining purity is history. Originalist methods supposedly discern in history a fixed constitutional meaning. Many originalists now claim that the most advanced method-the approach that reveals the purest constitution...

In this chapter, we propose a new method to measure the importance of input variables and to examine the effect of the input variables on other components. We applied the method to competitive learning, in particular, self-organizing maps, to demonstrate the performance of our method. Because our method is based upon our information-theoretic competitive learning, it is easy to incorporate the ...

Constraint propagation can often be conveniently expressed by rules. In recent years, a number of techniques for automatic generation of rule-based constraint solvers have been developed, most of them using a generate-and-test approach. We examine a generation method that is based on deduction. A solver (i. e., a set of rules) for a complex constraint is obtained from one or several weaker solv...

In this paper, we present a Satisfiability Modulo Theory based (SMT-based) bounded model checking (BMC) method for Timed Real-Weighted Interpreted Systems and for the existential fragment of the Weighted Epistemic Computation Tree Logic. SMT-based bounded model checking consists in translating the existential model checking problem for a modal logic and for a model to the satisfiability problem...