528 search results - page 17 / 106 » Transition Logic Revisited |
130
click to vote
CSL
2007
Springer
15 years 8 months ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
131
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
109
click to vote
FOIS
2010
15 years 3 months ago
2010
Considerations regarding predication in ordinary language as well as the ontology of relations suggest a refinement of the Ontological Square, a conceptual scheme used in many foun...
115
Voted
AAAI
2000
15 years 3 months ago
2000
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
113
click to vote
CADE
2004
Springer
16 years 2 months ago
2004
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...