#### Filter Results:

#### Publication Year

1992

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The complexity classes P=log and Full-P=log, corresponding to the two standard forms of logarithmic advice for polynomial time, are studied. The novel proof technique of \doubly exponential skip" is introduced, and characterizations for these classes are found in terms of several other concepts, among them easy-to-describe boolean circuits and reduction… (More)

A nonuniform class called here Full-P/log, due to Ko, is studied. It corresponds to polynomial time with logarithmically long advice. Its importance lies in the structural properties it enjoys, more interesting than those of the alternative class P/log; speciically, its introduction was motivated by the need of a logarithmic advice class closed under… (More)

It is well-known that the class P=poly can be characterized in terms of polynomial size circuits. We obtain a characterization of the class P= log using polynomial size circuits with low resource-bounded Kolmogorov Complexity. The concept of \small circuits with easy descriptions" has been introduced in the literature as a candidate to characterizing P=… (More)

Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goal-directed proofs, etc. Unfortunately, in temporal logic, existing sequent calculi make use of a kind of inference rules that prevent the effective mechanization of temporal deduction in… (More)

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: On one hand, traditional tableau systems for temporal logic (TL) generate an auxiliary… (More)

The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisfaction is made from the graph and it does not correspond with the application of rules in any calculus for PLTL. We present here a new method of semantic tableaux without using… (More)

- Montserrat Hermo
- 1996

Circuit expressions were introduced to provide a natural link between Computational Learning and certain aspects of Structural Complexity. Upper and lower bounds on the learnability of circuit expressions are known. We study here the case in which the circuit expressions are of low (time-bounded) Kolmogorov complexity. We show that these are polynomial-time… (More)

Horn ⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of structuring programs in logic programming. Restricted to the propositional setting of this language, we prove that any goal in Horn ⊃ can be translated into a monotone Boolean… (More)