2062 search results - page 103 / 413 » Derivatives of Logical Formulas |
138
Voted
ILP
2007
Springer
15 years 10 months ago
2007
Springer
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
142
click to vote
IANDC
2007
15 years 3 months ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
140
click to vote
LATA
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
112
click to vote
IJCAI
2001
15 years 5 months ago
2001
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
115
click to vote
WLP
2005
Springer
15 years 9 months ago
2005
Springer
Assigning semantics to logic programs via selector generated models (Schwarz 2002/2003) extends several semantics, like the stable, the inflationary, and the stable generated sema...