Representing First-Order Causal Theories by Logic Programs

Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain's embedding of definite propositional causal theories into logic programming paved the way to the use of answer set solvers for answering queries about actions described in such languages. In this paper we extend this embedding to nondefinite theories and to first-order causal logic.Comment: 29 pages. To appear in Theory and Practice of Logic Programming (TPLP); Theory and Practice of Logic Programming, May, 201

First-principles generation of Stereographic Maps for high-field magnetoresistance in normal metals: an application to Au and Ag

About thirty high-field magnetoresistance Stereographic Maps have been measured for metals between Fifties and Seventies but no way was known till now to compare these complex experimental data with first-principles computations. We present here the method we developed to generate Stereographic Maps directly from a metal's Fermi Surface, based on the Lifshitz model and the recent advances by S.P. Novikov and his pupils. As an application, we test the method with an interesting toy model and then with Au and Ag.Comment: 10 pages, 11 figure

Temporal Phylogenetic Networks and Logic Programming

The concept of a temporal phylogenetic network is a mathematical model of evolution of a family of natural languages. It takes into account the fact that languages can trade their characteristics with each other when linguistic communities are in contact, and also that a contact is only possible when the languages are spoken at the same time. We show how computational methods of answer set programming and constraint logic programming can be used to generate plausible conjectures about contacts between prehistoric linguistic communities, and illustrate our approach by applying it to the evolutionary history of Indo-European languages. To appear in Theory and Practice of Logic Programming (TPLP)

On Equivalence of Infinitary Formulas under the Stable Model Semantics

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show how to apply this generalization to proving properties of aggregates in answer set programming. To appear in Theory and Practice of Logic Programming (TPLP)

Fages' Theorem and Answer Set Programming

We generalize a theorem by Francois Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by a satisfiability solver, and the use of answer set solvers such as smodels and dlv is unnecessary. A logic programming representation of the blocks world due to Ilkka Niemelae is discussed as an example

Tight Logic Programs

This note is about the relationship between two theories of negation as failure -- one based on program completion, the other based on stable models, or answer sets. Francois Fages showed that if a logic program satisfies a certain syntactic condition, which is now called ``tightness,'' then its stable models can be characterized as the models of its completion. We extend the definition of tightness and Fages' theorem to programs with nested expressions in the bodies of rules, and study tight logic programs containing the definition of the transitive closure of a predicate.Comment: To appear in Special Issue of the Theory and Practice of Logic Programming Journal on Answer Set Programming, 200

Intelligent Instantiation and Supersafe Rules

In the input languages of most answer set solvers, a rule with variables has, conceptually, infinitely many instances. The primary role of the process of intelligent instillation is to identify a finite set of ground instances of rules of the given program that are "essential" for generating its stable models. This process can be launched only when all rules of the program are safe. If a program contains arithmetic operations or comparisons then its rules are expected to satisfy conditions that are even stronger than safety. This paper is an attempt to make the idea of an essential instance and the need for "supersafety" in the process of intelligent instantiation mathematically precise

A Natural yet Providential Tongue: Moses Mendelssohn on Hebrew as a Language of Action

How did Moses Mendelssohn reconcile a naturalistic theory of language, advocating the contingent development of all tongues, with the belief that Hebrew did not change ever since its inception? The seeming contradiction was resolved by employing the contemporary notion of the language of action – a primordial human means of communication, where gesture and melody were as significant as words. Mendelssohn’s view of Hebrew as the language closest to this idiom was accompanied by his suggestion that the Jewish ceremonial law is a living script which can be properly understood only through oral instruction. He employed both ideas to counter the notions that the Hebrew vowel points were a late invention and that some loci in the Hebrew Bible had been subject to textual corruption. For Mendelssohn, the allegedly supernatural aspects of spoken Hebrew could be naturalised through constant and lively human conversation across the ages. The appropriation of contemporary critiques of the arbitrariness of language allowed Mendelssohn to forge an original synthesis that could simultaneously accommodate naturalism and providentialism