Sciweavers

77 search results - page 12 / 16
» Reasoning by Cases without Contraposition in Default Logic
Sort
View
CLEIEJ
2010
14 years 9 months ago
Teaching Programming Principles through a Game Engine
Teaching fundamental programming to freshmen is a hard task to be performed, given the high level action and logical reasoning that are required for these students to develop in a...
Cristiane Camilo Hernandez, Luciano Silva, Rafael ...
ASP
2003
Springer
15 years 5 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
CADE
2003
Springer
16 years 20 days ago
The Model Evolution Calculus
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
Peter Baumgartner, Cesare Tinelli
KR
2004
Springer
15 years 5 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
DLOG
2008
15 years 2 months ago
All Elephants are Bigger than All Mice
Abstract. We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural ty...
Sebastian Rudolph, Markus Krötzsch, Pascal Hi...