Nominal Logic Programming

Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, alpha-equivalence). This article investigates logic programming based on nominal logic. We describe some typical nominal logic programs, and develop the model-theoretic, proof-theoretic, and operational semantics of such programs. Besides being of interest for ensuring the correct behavior of implementations, these results provide a rigorous foundation for techniques for analysis and reasoning about nominal logic programs, as we illustrate via examples.Comment: 46 pages; 19 page appendix; 13 figures. Revised journal submission as of July 23, 200

Improving argumentation-based recommender systems through context-adaptable selection criteria

Recommender Systems based on argumentation represent an important proposal where the recommendation is supported by qualitative information. In these systems, the role of the comparison criterion used to decide between competing arguments is paramount and the possibility of using the most appropriate for a given domain becomes a central issue; therefore, an argumentative recommender system that offers an interchangeable argument comparison criterion provides a significant ability that can be exploited by the user. However, in most of current recommender systems, the argument comparison criterion is either fixed, or codified within the arguments. In this work we propose a formalization of context-adaptable selection criteria that enhances the argumentative reasoning mechanism. Thus, we do not propose of a new type of recommender system; instead we present a mechanism that expand the capabilities of existing argumentation-based recommender systems. More precisely, our proposal is to provide a way of specifying how to select and use the most appropriate argument comparison criterion effecting the selection on the user´s preferences, giving the possibility of programming, by the use of conditional expressions, which argument preference criterion has to be used in each particular situation.Fil: Teze, Juan Carlos Lionel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación; Argentina. Universidad Nacional de Entre Ríos; ArgentinaFil: Gottifredi, Sebastián. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación; ArgentinaFil: García, Alejandro Javier. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación; ArgentinaFil: Simari, Guillermo Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación; Argentin

Knowledge Assessment: A Modal Logic Approach

The possible worlds semantics is a fruitful approach used in Artificial Intelligence (AI) for both modelling as well as reasoning about knowledge in agent systems via modal logics. In this work our main idea is not to model/reason about knowledge but to provide a theoretical framework for knowledge assessment (KA) with the help of Monatague-Scott (MS) semantics of modal logic. In KA questions asked and answers collected are the central elements and knowledge notions will be defined from these (i.e., possible states of knowledge of subjects in a population with respect to a field of information)

Cross-National Logo Evaluation Analysis: An Individual Level Approach

The universality of design perception and response is tested using data collected from ten countries: Argentina, Australia, China, Germany, Great Britain, India, the Netherlands, Russia, Singapore, and the United States. A Bayesian, finite-mixture, structural-equation model is developed that identifies latent logo clusters while accounting for heterogeneity in evaluations. The concomitant variable approach allows cluster probabilities to be country specific. Rather than a priori defined clusters, our procedure provides a posteriori cross-national logo clusters based on consumer response similarity. To compare the a posteriori cross-national logo clusters, our approach is integrated with Steenkamp and Baumgartner’s (1998) measurement invariance methodology. Our model reduces the ten countries to three cross-national clusters that respond differently to logo design dimensions: the West, Asia, and Russia. The dimensions underlying design are found to be similar across countries, suggesting that elaborateness, naturalness, and harmony are universal design dimensions. Responses (affect, shared meaning, subjective familiarity, and true and false recognition) to logo design dimensions (elaborateness, naturalness, and harmony) and elements (repetition, proportion, and parallelism) are also relatively consistent, although we find minor differences across clusters. Our results suggest that managers can implement a global logo strategy, but they also can optimize logos for specific countries if desired.adaptation;standardization;Bayesian;international marketing;design;Gibbs sampling;concomitant variable;logos;mixture models;structural equation models

Symbol–Relation Grammars: A Formalism for Graphical Languages

AbstractA common approach to the formal description of pictorial and visual languages makes use of formal grammars and rewriting mechanisms. The present paper is concerned with the formalism of Symbol–Relation Grammars (SR grammars, for short). Each sentence in an SR language is composed of a set of symbol occurrences representing visual elementary objects, which are related through a set of binary relational items. The main feature of SR grammars is the uniform way they use context-free productions to rewrite symbol occurrences as well as relation items. The clearness and uniformity of the derivation process for SR grammars allow the extension of well-established techniques of syntactic and semantic analysis to the case of SR grammars. The paper provides an accurate analysis of the derivation mechanism and the expressive power of the SR formalism. This is necessary to fully exploit the capabilities of the model. The most meaningful features of SR grammars as well as their generative power are compared with those of well-known graph grammar families. In spite of their structural simplicity, variations of SR grammars have a generative power comparable with that of expressive classes of graph grammars, such as the edNCE and the N-edNCE classes

Social Services Management Solution

The modern privately run social services agency exists within a complex regulatory framework that requires detailed recordkeeping. In such an environment, paperwork tracking is best managed by a centralized enterprise data management system. While commercial applications that perform this function exist, they are frequently bundled with software for other business functions. Such additional software can be helpful, but it frequently duplicates the functionality of other enterprise software for these businesses, which is financially inefficient. This project developed a similar system using the ASP.NET 4.5 framework that is designed to provide a standalone solution to recordkeeping requirements. It followed a typical agile development cycle. Software requirements were gathered, design documents were drafted, and the application was developed. It was deployed to the Microsoft Azure cloud for testing. The results indicate that it could be a viable alternative to the bundled offerings available in the market with some additional development and tweaking for Microsoft Azure in future iterations