This paper presents a structured, annotated bibliography of extensions of logic programming based on temporal and modal logics. Temporal and modal logic programming is a new area of research, which gained momentum in the late 1980'ies. The paper discusses temporal and modal logic programming under three headings: (1) interval logic programming , (2) temporal logic programming, and (3) modal log...

The VERB campaign uses a logic model as a tool to share information, to facilitate program planning, and to provide direction for evaluation. Behavior change and communication theories are incorporated to help hypothesize how behavior change might occur. Evaluation of the campaign follows the process of the logic model. The elements of the logic model are described and further explanation "pops...

a controversy among the muslim philosophers about the domain of the extensions was that is the subject of the verity-propositions contained the impossible extensions or only all of the actual and possible ones. from ibn-sina to al-khunaji, there are explicit texts to the former view; but later logicians, starting with athir al-din al-abhari, were inclined to the latter. in this paper, we attamp...

Field-programmable gate arrays (FPGAs) are nonconventional processors built almost entirely out of lookup tables. In particular, FPGAs contain grids of logic blocks, connected by a grid of wires with programmable connections. Each logic block has one or more lookup tables and several bits of memory. As a result, logic blocks can implement arbitrary logic functions (up to a few bits), or be comb...

The aim of this note is rst to set up some general theory for discussing diierent aspects of the notion of a logic and then to draw attention to the schematic aspects of logic and suggest a way of capturing this aspect without making any commitment to the kind of syntax a logic should have.

A set of p-valued logic gates (primitives) is called universal if an arbitrary p-valued logic function can be realized by a logic circuit built up from a finite number of gates belonging to this set. In the paper, we consider the problem of determining the number of universal single-element sets of ternary reversible logic gates with two inputs and two outputs. We have established that over 97%...

Abstract How many correct logics are there? Monists endorse that there is one, pluralists argue for many, and nihilists claim none. Reasoning about these views requires a logic. That the meta-logic. It turns out some meta-logical challenges specifically pluralists. I will depend on an implicitly assumed absoluteness of Pluralists can solve by giving up this instead adopt contextualism This natu...

Termination of logic programs with negated body atoms, here called general logic programs, is an important topic. This is also due to the fact that the computational mechanisms used to process negated atoms, like Clark's negation as failure and Chan's constructive negation, are based on termination conditions. This paper introduces a methodology for proving termination of general logic programs...