Tore Langholm

According to our database, Tore Langholm authored at least 12 papers between 1987 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2008

Default Logics with Preference Order: Principles and Characterisations.

Tore Langholm

Proceedings of the Logic for Programming, 2008

2007

Only knowing with degrees of confidence.

Arild Waaler, Johan W. Klüwer, Tore Langholm, Espen H. Lian

J. Appl. Log., 2007

Completeness and Decidability in Sequence Logic.

Marc Bezem, Tore Langholm, Michal Walicki

Proceedings of the Logic for Programming, 2007

2006

A descriptive characterisation of linear languages.

Tore Langholm

J. Log. Lang. Inf., 2006

2005

Default Reasoning with Preference Within Only Knowing Logic.

Iselin Engan, Tore Langholm, Espen H. Lian, Arild Waaler

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

2004

Black Box and White Box Identification of Formal Languages Using Test Sets.

Marc Bezem, Christian Sloper, Tore Langholm

Grammars, 2004

Only Knowing with Confidence Levels: Reductions and Complexity.

Espen H. Lian, Tore Langholm, Arild Waaler

Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

2003

A Descriptive Characterisation of Even Linear Languages.

Tore Langholm, Marc Bezem

Grammars, 2003

2001

A Descriptive Characterisation of Indexed Grammars.

Tore Langholm

Grammars, 2001

1998

A Strong Version of Herbrand's Theorem for Introvert Sentences.

Tore Langholm

J. Symb. Log., 1998

1990

What is a Horn Clause in Partial Logic?

Tore Langholm

Proceedings of the Logics in AI, European Workshop, 1990

1987

H. B. Smith on modality: A logical reconstruction.

Tore Langholm

J. Philos. Log., 1987