#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1992

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- José L. Balcázar, Montserrat Hermo, Elvira Mayordomo
- IFIP Congress
- 1992

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)

- José L. Balcázar, Montserrat Hermo
- Theor. Comput. Sci.
- 1998

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)

- Montserrat Hermo, Elvira Mayordomo
- Mathematical systems theory
- 1994

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 for characterizing P/log.… (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)

- Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas
- J. Log. Algebr. Program.
- 2009

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)

- Montserrat Hermo
- 1996

- Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro
- Electr. Notes Theor. Comput. Sci.
- 2008

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)

- José L. Balcázar, Harry Buhrman, Montserrat Hermo
- EuroCOLT
- 1995

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)

- Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas
- Journal of Automated Reasoning
- 2011

Resolution is a well-known proof method for classical logics that is well suited for mechanization. The most fruitful approach in the literature on temporal logic, which was started with the seminal paper of M. Fisher, deals with Propositional Linear-time Temporal Logic (PLTL) and requires to generate invariants for performing resolution on eventualities.… (More)

- Joxe Gaintzarain, Montserrat Hermo, Marisa Navarro
- MFCS
- 2005

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)