Search Sciweavers | Sciweavers

119 search results - page 2 / 24

» Tree-Width for First Order Formulae

click to vote

PUK
2000

118views Computer Science» more PUK 2000»

On the Instantiation of ADL Operators Involving Arbitrary First-Order Formulas

14 years 10 months ago

Download www-is.informatik.uni-oldenburg.de

The generation of the set of all ground actions for a given set of ADL operators, which are allowed to have conditional effects and preconditions that can be represented using arbi...

Jana Koehler, Jörg Hoffmann

claim paper

Read More »

Voted

IJCAI
2001

125views Artificial Intelligence» more IJCAI 2001»

Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas

14 years 11 months ago

Download cs.nyu.edu

A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...

Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...

claim paper

Read More »

click to vote

CADE
2003
Springer

158views Logical Reasoning» more CADE 2003»

A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae

15 years 9 months ago

Download www.csc.liv.ac.uk

In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...

Renate A. Schmidt, Ullrich Hustadt

claim paper

Read More »

click to vote

TBILLC
2007
Springer

134views Natural Language Processing» more TBILLC 2007»

The Modal Formula (...) Is Not First-Order Definable

15 years 3 months ago

Download www.illc.uva.nl

Ali Karatay

claim paper

Read More »