Complexity analysis provides a measure of how well the computations being performed by a cognitive model are supported by the constraints of biological computing. We argue that research in computational cognitive science will be greatly aided by treating computational complexity as a primary issue on the same order of importance as significance analysis in experimental work. In this paper, we g...

This paper establishes a sound and complete semantics for the impure logic of ground. Fine (Review Symbolic Logic, 5(1), 1–25, 2012a) sets out system pure ground, one in which formulas between ground-theoretic claims hold have no internal logical complexity; it provides system. (2012b) [§§6-8] an that extends rules original with truth-functional connectives, first-order quantifiers, ?-abstracti...

Most of the computational color constancy approaches are based on the assumption of a uniform illumination in the scene which is not the case in many real world scenarios. A crucial ingredient in developing color constancy algorithms which can handle these scenarios is a dataset of such images with accurate illumination ground truth to be used both for estimating the parameters and for evaluati...

In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of information. Based on this semantics, we develop efficient algorithms that can answer queries for non-ground programs with the help of an SLD-like procedure. We also analyze the computational complexity of the algorithms and illustrat...

A runway incursion is defined as any occurrence in the airport runway environment involving an aircraft, vehicle, person, or object on the ground that creates a collision hazard or results in a loss of required separation with an aircraft taking off, intending to take off, landing, or intending to land. Multiple factors could contribute to runway incursion, including pilots’ failure to accurate...

Deployment of a satellite borne, steerable antenna array with higher directivity and gain in Low Earth Orbit makes sense to reduce ground station complexity and cost, while still maintaining a reasonable link budget. The implementation comprises a digitally beam steerable phased array antenna integrated with a complete system, comprising the antenna, hosting platform, ground station, and aircra...

1 A generalization of logic program rules is proposed where rules are built from weight constraints with type information for each predicate instead of simple literals. These kinds of constraints are useful for concisely representing di erent kinds of choices as well as cardinality, cost and resource constraints in combinatorial problems such as product con guration. A declarative semantics for...

In this paper, we propose a formal framework for specifying rule replacements in nonmonotonic logic programs within the answer-set programming paradigm. Of particular interest are replacement schemas retaining specific notions of equivalence, among them the prominent notions of strong and uniform equivalence, which have been introduced as theoretical tools for program optimization and verificat...

Using the automata with constraints, we give an algorithm for the decision of ground reducibility of a term t w.r.t. a rewriting system R. The complexity of the algorithm is doubly exponential in the maximum of the depths of t and R and the cardinal of R.

ion Rules Abst1: Variable instantiations with essential ground terms of complexity r (using a modified version of our work [SMT’2013]) Abst2: φ := (l ∨ φrest), (¬l ∨ Crest) ∈ CNF (F ) =⇒ φ φ[Crest / l ] Abst3: φ := (¬φ(t) ∨ φrest), t := pg =⇒ φ φ[(∀x . x = t ∨ (t, x)d ∈ tcR → φ(x)) / φ(t)]