ACM DL

Computational Logic (TOCL)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Computational Logic (TOCL), Volume 14 Issue 2, June 2013

First-Order Logic on Higher-Order Nested Pushdown Trees
Alexander Kartzow
Article No.: 8
DOI: 10.1145/2480759.2480760

We introduce a new hierarchy of higher-order nested pushdown trees generalising Alur et al.’s concept of nested pushdown trees. Nested pushdown trees are useful representations of control flows in the verification of programs with...

Fair Synthesis for Asynchronous Distributed Systems
Paul Gastin, Nathalie Sznajder
Article No.: 9
DOI: 10.1145/2480759.2480761

We study the synthesis problem in an asynchronous distributed setting: a finite set of processes interact locally with an uncontrollable environment and communicate with each other by sending signals -- actions controlled by a sender process and...

Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
Paulo Shakarian, Matthias Broecheler, V. S. Subrahmanian, Cristian Molinaro
Article No.: 10
DOI: 10.1145/2480759.2480762

There has been extensive work in many different fields on how phenomena of interest (e.g., diseases, innovation, product adoption) “diffuse” through a social network. As social networks increasingly become a fabric of society, there is...

Instantiation Schemes for Nested Theories
Mnacho Echenim, Nicolas Peltier
Article No.: 11
DOI: 10.1145/2480759.2480763

This article investigates under which conditions instantiation-based proof procedures can be combined in a nested way, in order to mechanically construct new instantiation procedures for richer theories. Interesting applications in the...

Parallel Abductive Query Answering in Probabilistic Logic Programs
Gerardo I. Simari, John P. Dickerson, Amy Sliva, V. S. Subrahmanian
Article No.: 12
DOI: 10.1145/2480759.2480764

Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behaviors of entities. Rules in ap-programs have the form “If...

Topological Logics with Connectedness over Euclidean Spaces
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann, Michael Zakharyaschev
Article No.: 13
DOI: 10.1145/2480759.2480765

We consider the quantifier-free languages, Bc and Bc°, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a...

A Model-Theoretic Approach to Belief Change in Answer Set Programming
James Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran
Article No.: 14
DOI: 10.1145/2480759.2480766

We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model...

Tableau Calculi for Logic Programs under Answer Set Semantics
Martin Gebser, Torsten Schaub
Article No.: 15
DOI: 10.1145/2480759.2480767

We introduce formal proof systems based on tableau methods for analyzing computations in Answer Set Programming (ASP). Our approach furnishes fine-grained instruments for characterizing operations as well as strategies of ASP solvers. The...

Query-Driven Procedures for Hybrid MKNF Knowledge Bases
José Júlio Alferes, Matthias Knorr, Terrance Swift
Article No.: 16
DOI: 10.1145/2480759.2480768

Hybrid MKNF knowledge bases are one of the most prominent tightly integrated combinations of open-world ontology languages with closed-world (nonmonotonic) rule paradigms. Based on the logic of minimal knowledge and negation as failure (MKNF), the...