Sciweavers

105 search results - page 2 / 21
» Automated Reasoning in Some Local Extensions of Ordered Stru...
Sort
View
LPAR
2007
Springer
13 years 11 months ago
Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
Richard Bonichon, David Delahaye, Damien Doligez
CL
2000
Springer
13 years 10 months ago
Logic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
David Lacey, Julian Richardson, Alan Smaill
TIME
1994
IEEE
13 years 9 months ago
Localized Temporal Reasoning: A State-Based Approach
We are concerned with temporalreasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence co...
Shieu-Hong Lin, Thomas Dean
RTA
1995
Springer
13 years 9 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
COMMA
2010
13 years 17 days ago
Reasoning about Preferences in Structured Extended Argumentation Frameworks
Abstract. This paper combines two recent extensions of Dung's abstract argumenrameworks in order to define an abstract formalism for reasoning about preferences in structured ...
Sanjay Modgil, Henry Prakken